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...

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 ...

In this paper we study an assembly line balancing problem that occurs in sheltered worker centers for the disabled, where workers with very different characteristics are present. We are interested in the situation in which complete parallel assembly lines are allowed and name the resulting problem as parallel assembly line worker assignment and balancing problem (PALWABP). This approach enables...

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the classical simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority ...

Abstract The paper is motivated by real problems concerning tasks assignment to workers in medium-sized upholstered furniture plants managed using the Demand-Driven Manufacturing. Although methodology was developed for it can be applied other types of production plants. We involve competence coefficients, which describe level worker’s skills or capabilities perform a specific task. coefficients...

We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize the online task assignment problem, in which a requester has a fixed set of tasks and a budget that specifies how many times he would like each task completed. Workers arrive one at a time (with the same worker potentia...

Assembly lines appear with various differentiations in order to better include the disabled labor market and increase production efficiency. In this way, optimal workforce assignment problem that emerges heterogeneously is called assembly line worker balancing (ALWABP). This paper addresses ALWABP where simple version enriched by considering sequence-dependent setup times between tasks. A mixed...

Distributed computing enables large-scale computation tasks to be processed by multiple workers in parallel. However, the randomness of communication and delays across causes straggler effect, which may degrade delay performance. Coded helps mitigate but amount redundant load task assignment should carefully optimized. In this work, we consider a multi-master heterogeneous-worker distrib...

We consider a task assignment problem in crowdsourcing, which is aimed at collecting as many reliable labels as possible within a limited budget. A challenge in this scenario is how to cope with the diversity of tasks and the task-dependent reliability of workers; for example, a worker may be good at recognizing the names of sports teams but not be familiar with cosmetics brands. We refer to th...