Computer Science – Data Structures and Algorithms
Scientific paper
2010-03-18
Computer Science
Data Structures and Algorithms
18 pages, 1 figure
Scientific paper
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 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.
Chaves Antonio A.
Costa Alysson M.
Moreira Mayron César O.
Ritt Marcus
No associations
LandOfFree
Simple heuristics for the assembly line worker assignment and balancing problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Simple heuristics for the assembly line worker assignment and balancing problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple heuristics for the assembly line worker assignment and balancing problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-353570