Advertisement

Journal of Heuristics

, Volume 18, Issue 3, pp 505–524 | Cite as

Simple heuristics for the assembly line worker assignment and balancing problem

  • Mayron César O. Moreira
  • Marcus Ritt
  • Alysson M. Costa
  • Antonio A. Chaves
Article

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.

Keywords

Assembly lines Disabled workers Heuristic approaches Hybrid genetic algorithm 

Notes

Acknowledgements

This research was supported by the Brazilian Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq, Brazil) and by Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP, Brazil). This support is gratefully acknowledged. The authors are also thankful to two anonymous referees and to the Associate Editor whose comments have helped improve the quality of this paper.

References

  1. Baybars, I.: A survey of exact algorithms for the simple assembly line balancing problem. Manag. Sci. 32, 909–932 (1986) MathSciNetzbMATHCrossRefGoogle Scholar
  2. Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154–160 (1994) zbMATHCrossRefGoogle Scholar
  3. Blum, C., Miralles, C.: On solving the assembly line worker assignment and balancing problem via beam search. Comput. Oper. Res. 38, 328–339 (2011) MathSciNetzbMATHCrossRefGoogle Scholar
  4. Boysen, N., Fliedner, M., Scholl, A.: A classification of assembly line balancing problems. Eur. J. Oper. Res. 183, 674–693 (2007) zbMATHCrossRefGoogle Scholar
  5. Boysen, N., Fliedner, M., Scholl, A.: Assembly line balancing: Which model to use when? Int. J. Prod. Econ. 111, 509–528 (2008) CrossRefGoogle Scholar
  6. Chaves, A.A., Miralles, C., Lorena, L.A.N.: Clustering search approach for the assembly line worker assignment and balancing problem. In: Proc. of the 37th International Conference on Computers and Industrial Engineering, Alexandria, Egypt, pp. 1469–1478 (2007) Google Scholar
  7. Chaves, A.A., Lorena, L.A.N., Miralles, C.: Hybrid metaheuristic for the assembly line worker assignment and balancing problem. Lect. Notes Comput. Sci. 5818, 1–14 (2009) CrossRefGoogle Scholar
  8. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989) zbMATHGoogle Scholar
  9. Gonçalves, J.F., de Almeida, J.R.: A hybrid genetic algorithm for assembly line balancing. J. Heuristics 8(6), 629–642 (2004) CrossRefGoogle Scholar
  10. Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1975) Google Scholar
  11. Klein, R., Scholl, A.: Computing lower bounds by destructive improvement—an application to resource-constrained project scheduling. Eur. J. Oper. Res. 112, 322–346 (1999) zbMATHCrossRefGoogle Scholar
  12. Mendes, J.J.M., Gonçalves, J.F., Resende, M.G.C.: A random key based genetic algorithm for the resource constrained project scheduling problem. Comput. Oper. Res. 36(1), 92–109 (2009) MathSciNetzbMATHCrossRefGoogle Scholar
  13. Miralles, C., Garcia-Sabater, J.P., Andrés, C., Cardos, M.: Advantages of assembly lines in sheltered work centres for disabled. A case study. Int. J. Prod. Econ. 110, 187–197 (2007) CrossRefGoogle Scholar
  14. Miralles, C., Garcia-Sabater, J.P., Andrés, C., Cardos, M.: Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled. Discrete Appl. Math. 156, 352–367 (2008) MathSciNetzbMATHCrossRefGoogle Scholar
  15. Moreira, M.C.O., Costa, A.M.: A minimalist yet efficient tabu search for balancing assembly lines with disabled workers. In: Anais do XLI Simpósio Brasileiro de Pesquisa Operacional, Porto Seguro (2009) Google Scholar
  16. Scholl, A.: Balancing and Sequencing of Assembly Lines. Physica, Heidelberg (1999) Google Scholar
  17. Scholl, A., Becker, C.: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur. J. Oper. Res. 168(3), 666–693 (2006) MathSciNetzbMATHCrossRefGoogle Scholar
  18. Scholl, A., Voß, S.: Simple assembly line balancing—heuristic approaches. J. Heuristics 2, 217–244 (1996) CrossRefGoogle Scholar
  19. Talbot, F.B., Patterson, J.H., Gehrlein, W.V.: A comparative evaluation of heuristic line balancing techniques. Manag. Sci. 32(4), 430–454 (1986) CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Mayron César O. Moreira
    • 1
  • Marcus Ritt
    • 2
  • Alysson M. Costa
    • 1
  • Antonio A. Chaves
    • 3
  1. 1.Instituto de Ciências Matemáticas e de ComputaçãoUniversidade de São PauloSão CarlosBrazil
  2. 2.Instituto de InformáticaUniversidade Federal do Rio Grande do SulPorto AlegreBrazil
  3. 3.Faculdade de Eng. de GuaratinguetáUniversidade Estadual Paulista J. de Mesquita FilhoSão PauloBrazil

Personalised recommendations