Introduction: The two-sided matching model of Gale and Shapley (1962) can be interpreted as one where a non-empty finite set of firms need to employ a non-empty finite set of workers. Further, each firm can employ at most one worker and each worker can be employed by at most one firm. Each worker has preferences over the set of firms and each firm has preferences over the set of workers. An ass...

Task assignment is a central component in crowdsourcing. Organizational studies have shown that worker motivation in completing tasks has a direct impact on the quality of individual contributions. In this work, we examine motivationaware task assignment in the presence of a set of workers. We propose to model motivation as a balance between task relevance and task diversity and argue that an a...

This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...

The mixed work assignment technique was applied to the modular production concept solve apparel assembly line balancing problem. Specifically, an algorithm implemented generate workstations by first classifying tasks into modules through analysis of manufacturing process and assigning grouped in single task–multiple workers multiple tasks–single worker methods. Then, sequentially performed cons...

This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...

We consider the following budgeted online assignment (BOA) problem motivated by crowdsourcing. We are given a set of offline tasks that need to be assigned to workers who come online from the pool of types {1, 2, . . . , n}. For a given time horizon {1, 2, . . . , T}, at each instant of time t, a worker j arrives from the pool in accordance with a known probability distribution [pjt] such that ...

This paper develops a mathematical model in dynamic virtual cellular manufacturing systems with the multiperiod cell formation problem, production planning, dynamic virtual system reconfiguration and training workers. Since workers have important role in doing jobs on machines, assignment of workers to cells becomes a crucial factor in cellular manufacturing system. Also we have shown the role ...

Virtual cellular manufacturing systems (VCMS) have come into existence, replacing traditional cellular manufacturing systems (CMS), to meet highly dynamic production conditions in terms of demand, processing times, product mix and processing sequence. While cell formation phase of VCMS has been dealt quite voluminously, worker assignments phase has gained momentum recently after researchers sta...