A comparative evaluation of heuristic line balancing techniques
Management Science
A survey of exact algorithms for the simple assembly line balancing problem
Management Science
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A Hybrid Genetic Algorithm for Assembly Line Balancing
Journal of Heuristics
A random key based genetic algorithm for the resource constrained project scheduling problem
Computers and Operations Research
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
Computers and Operations Research
A branch-and-bound algorithm for assembly line worker assignment and balancing problems
Computers and Operations Research
Computers and Operations Research
Hi-index | 0.00 |
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 well-known 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 rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.