Assembly Line Worker Assignment and Balancing Problem by Considering Labor Cost

Assembly Line Worker Assignment and Balancing Problem by Considering Labor Cost

Assignment of worker appears as a new problem in the literature for assembly lines (AL) where the workforce is heterogeneously located. The difference of this line balancing from the traditional line is that the assembly task times of the workers to be assigned to the stations differ from each other. Especially assembly lines issues are generally a labor-intensive type of production. Therefore, for assembly line problems, balancing activity should be done considering the labor costs. Thus, the proposed solutions will be able to produce more realistic results for real life. For this purpose, in this study, a mixed-integer mathematical formulation is presented for assembly line worker assignment and balancing problems by considering the objective function of minimizing labor costs and cycle time. The efficiency of the proposed model and the improvements have been demonstrated by solving test instances in the literature.

___

  • 1. Serin, F., Mete, S., Çelik, E., “An efficient algorithm for U-type assembly line re-balancing problem with stochastic task times”, Assembly Automation, 39(4):581–595, (2019).
  • 2. Baykasoğlu, A., Dereli, T., “Two-sided assembly line balancing using an ant-colony-based heuristic”, International Journal of Advanced Manufacturing Technology, 36(5/6):582-588, (2008).
  • 3. Make, M. R. A., Rashid, M. F. F. A., “Optimisation of Two-sided Assembly Line Balancing with Resource Constraints Using Modified Particle Swarm Optimisation”, Scientia Iranica, DOI: 10.24200/SCI.2020.52610.2797
  • 4. Rabbani, M., Manavizadeh, N., Shabanpour, N., “Sequencing of mixed models on U-shaped assembly lines by considering effective help policies in make-to-order environment”, Scientia Iranica, 24 (3), 1493-1504, (2017).
  • 5. Ege, Y., Azizoglu, M., Özdemirel, N.E. “Assembly line balancing with station paralleling”, Computers and Industrial Engineering, 57(4):1218-1225, (2009).
  • 6. Yeh, D.H., Kao, H.H. “A new bidirectional heuristic for the assembly line balancing problem”, Computers and Industrial Engineering, 57(4):1155-1160, (2009).
  • 7. Scholl, A., Becker, C. “State-of-the-art exact and heuristic solution procedures for simple assembly line balancing”, European Journal of Operational Research, 168(3):666-693, (2006).
  • 8. Becker, C., Scholl, A. “A survey on problems and methods in generalized assembly line balancing”, European Journal of Operational Research, 168(3):694-715, (2006).
  • 9. Blum C., Miralles, C. “On solving the assembly line worker assignment and balancing problem via beam search”, Computers & Operations Research, 38:328–339, (2011).
  • 10. Miralles, C., Garcıa-Sabater, J.P., Andres, C., Cardos, M., “Advantages of assembly lines in sheltered work centres for disabled. A case study.” International Journal of Production Economics, 110:187–197, (2007).
  • 11. Dolgui A., Kovalev S., Kovalyov MY, Malyutin S., Soukhal A., “Optimal workforce assignment to operations of a paced assembly line” European Journal of Operations Research, 264:200–211, (2018).
  • 12. Chaves A.A., Miralles C., Lorena L.A.N., “Clustering search approach for the assembly line worker assignment and balancing problem”, Proceedings of the 37th international conference on computers and industrial engineering, Alexandria, Egypt, 1469–1478, (2007).
  • 13. Miralles C., Garcia-Sabater J.P., Andres C., Cardos M., “Branch and bound procedures for solving the assembly line worker assignment and balancing problem: application to sheltered work centers for disabled”, Discrete Applied Mathematics, 156:352–367, (2008).
  • 14. Chaves, AA., Lorena, L.A.N., and Miralles, C., “Hybrid metaheuristic for the assembly line worker assignment and balancing problem”, Lecture Notes in Computer Science, 5818:1–14, (2009).
  • 15. Moreira, M.C.O., Ritt, M., Costa, A.M., Chaves, A.A., “Simple heuristics for the assembly line worker assignment and balancing problem”, Journal of Heuristics, 18:505–524, (2012).
  • 16. Mutlu, Ö., Polat, O., Supciller, A.A., “An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II”, Computers and Operations Research, 40:418–426, (2013).
  • 17. Vila, M., Pereira, J., “A branch-and-bound algorithm for assembly line worker assignment and balancing problems”, Computers and Operations Research, 44:105–114, (2014).
  • 18. Akyol, S.D., Baykasoğlu, A., “A multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem”, Journal of Intelligent Manufacturing, 30:557–573, (2016).
  • 19. Ramezanian, R., Ezzatpanah, A., “Modeling and solving multi-objective mixed-model assembly line balancing and worker assignment problem”, Computers and Industrial Engineering, 87:74–80, (2015).
  • 20. Janardhanan, M.N., Li, Z. and Nielsen, P., “Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem”, Soft Computing, 23:11263–11276, (2019).
  • 21. Amen, M., “Heuristic methods for cost-oriented assembly line balancing: a survey”, International Journal of Production Economics, 68:1-14, (2000).
  • 22. Scholl, A., Becker, C., “A note on ‘‘an exact method for costoriented assembly line balancing”. International Journal of Production Economics, 97:343–352, (2005).
  • 23. Roshani, A., Fattahi, P., Roshani, A., Salehi, M., Roshani, A., “Cost-oriented two-sided assembly line balancing problem: a simulated annealing approach”, International Journal of Computer Integreated Manufacturing, 25(8):689–715, (2012).
  • 24. Sungur, B., Yavuz, Y., “Assembly line balancing with hierarchical worker assignment”, Journal of Manufacturing Systems, 37:290–298, (2015).
  • 25. Amen, M., “Cost-oriented assembly line balancing model formulations, solution difficulty, upper and lower bounds”, European Journal of Operations Research, 168:747–770, (2006).
  • 26. Yılmaz, H., Demir, Y., “A New Mathematical Model for Assembly Line Worker Assignment and Balancing”, Journal of the Institute of Science and Technology, 9(4): 2002-2008, (2019).
  • 27. Öksüz, M. K., Buyukozkan, K., Satoglu, S. I., “U-shaped assembly line worker assignment and balancing problem:A mathematical model and two meta-heuristics”, Computers & Industrial Engineering, 112, 246-263, (2017).
  • 28. Zhang, Z., Tang, Q., Han, D. “Enhanced migrating birds optimization algorithm for U-shaped assembly line balancing problems with workers assignment”, Neural Comput & Applic 31, 7501–7515 (2019).
  • 29. Pereira, J., “The robust (minmax regret) assembly line worker assignment and balancing problem”, Computers & Operations Research, 93, 27-40, (2018).
  • 30. Akyol, S.D., Baykasoğlu, A. “ErgoALWABP: a multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem under ergonomic risk factors”, Journal of Intelligent Manufacturing, 30, 291–302 (2019).
  • 31. Yılmaz, H., Yılmaz, M., “Multi-manned assembly line balancing problem with balanced load density”, Assembly Automation, 35 (1), 137-142, (2015).
  • 32. Yılmaz, H., Yılmaz, M., “A mathematical model and tabu search algorithm for multi-manned assembly line balancing problems with assignment restrictions”, Engineering Optimization, 52, 856-874, (2020).