Simple heuristics for the assembly line worker assignment and balancing problem
Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
---|---|
Data(s) |
06/11/2013
06/11/2013
2012
|
Resumo |
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. Brazilian Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq, Brazil) Fundação de Amparo a Pesquisa do Estado de São Paulo (FAPESP), Brazil |
Identificador |
Journal of Heuristics, The Netherlands, v. 18, n. 3, supl. 1, Part 6, p. 505-524, jun, 2012 1381-1231 http://www.producao.usp.br/handle/BDPI/42026 10.1007/s10732-012-9195-5 |
Idioma(s) |
eng |
Publicador |
Springer The Netherlands |
Relação |
Journal of Heuristics |
Direitos |
closedAccess Copyright Springer |
Palavras-Chave | #ASSEMBLY LINES #DISABLED WORKERS #HEURISTIC APPROACHES #HYBRID GENETIC ALGORITHM #GENETIC ALGORITHM #CENTERS #ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES #SISTEMAS EMBUTIDOS #ROBÓTICA #COMPUTAÇÃO EVOLUTIVA #COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE #COMPUTER SCIENCE, THEORY & METHODS |
Tipo |
article original article publishedVersion |