You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/40316
Title: 
Simple heuristics for the assembly line worker assignment and balancing problem
Author(s): 
Institution: 
  • Universidade de São Paulo (USP)
  • Universidade Federal do Rio Grande do Sul (UFRGS)
  • Universidade Estadual Paulista (UNESP)
ISSN: 
1381-1231
Sponsorship: 
  • Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
  • Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Abstract: 
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.
Issue Date: 
1-Jun-2012
Citation: 
Journal of Heuristics. Dordrecht: Springer, v. 18, n. 3, p. 505-524, 2012.
Time Duration: 
505-524
Publisher: 
Springer
Keywords: 
  • Assembly lines
  • Disabled workers
  • Heuristic approaches
  • Hybrid genetic algorithm
Source: 
http://dx.doi.org/10.1007/s10732-012-9195-5
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/40316
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.