Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
Discrete Applied Mathematics
The harpy speech recognition system.
The harpy speech recognition system.
Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
On solving the assembly line worker assignment and balancing problem via beam search
Computers and Operations Research
Simple heuristics for the assembly line worker assignment and balancing problem
Journal of Heuristics
A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
INFORMS Journal on Computing
Computers and Operations Research
A branch-and-bound algorithm for assembly line worker assignment and balancing problems
Computers and Operations Research
| Hi-index | 0.01 |
In traditional assembly lines, it is reasonable to assume that task execution times are the same for each worker. However, in Sheltered Work Centres for Disabled this assumption is not valid: some workers may execute some tasks considerably slower or even be incapable of executing them. Worker heterogeneity leads to a problem called the Assembly Line Worker Assignment and Balancing Problem (ALWABP). For a fixed number of workers the problem is to maximize the production rate of an assembly line by assigning workers to stations and tasks to workers, while satisfying precedence constraints between the tasks. This paper introduces new heuristic and exact methods to solve this problem. We present a new MIP model, propose a novel heuristic algorithm based on beam search, as well as a task-oriented branch-and-bound procedure which uses new reduction rules and lower bounds for solving the problem. Extensive computational tests on a large set of instances show that these methods are effective and improve over existing ones.