Abstract
One of the most important operational issues in the assembly line is to assign tasks and workers to stations while balancing the workload of the workers. We consider the assembly line worker assignment and balancing problem (ALWABP) where the process time of a task depends on worker skill levels. We also consider new positional constraints in the ALWABP to secure the working area of the workers. Two mathematical programming models are proposed to assign workers and tasks when new products are introduced and when a worker is absent or leaves a position temporary, respectively. A heuristic algorithm for the first model is proposed due to its extremely high complexity. The experimental results show the efficiency of the proposed methods. Finally, we explain how the proposed models can be used with a real-time dashboard of a digital twin.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Salveson, M.E.: The assembly line balancing problem. J. Ind. Eng. 6(3), 18–25 (1955)
Gutjahr, A.L., Nemhauser, G.L.: An algorithm for the line balancing problem. Manage. Sci. 11(2), 308–315 (1964)
Thomopoulos, N.T.: Line balancing-sequencing for mixed-model assembly. Manage. Sci. 14(2), B59–B75 (1967)
Fattahi, P., Roshani, A., Roshani, A.: A mathematical model and ant colony algorithm for multi-manned assembly line balancing problem. Int. J. Adv. Manuf. Technol. 53(1–4), 363–378 (2011)
Miltenburg, G.J., Wijngaard, J.: The U-line Line Balancing Problem. Manage. Sci. 40(10), 1378–1388 (1994)
Miralles, C., GarcÃa-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(1–2), 187–197 (2007)
Vilà , M., Pereira, J.: A branch-and-bound algorithm for assembly line worker assignment and balancing problems. Comput. Oper. Res. 44, 105–114 (2014)
Borba, L., Ritt, M.: A heuristic and a branch-and-bound algorithm for the Assembly Line Worker Assignment and Balancing Problem. Comput. Oper. Res. 45, 87–96 (2014)
Li, Z., Kucukkoc, I., Tang, Q.: Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem. Comput. Oper. Res. 131, 105235 (2021). https://doi.org/10.1016/j.cor.2021.105235
Blum, C., Miralles, C.: On solving the assembly line worker assignment and balancing problem via beam search. Comput. Oper. Res. 38, 328–339 (2011)
Mutlu, Ö., Polat, O., Supciller, A.A.: An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II. Comput. Oper. Res. 40, 418–426 (2013)
Moreira, M.C.O., Ritt, M., Costa, A., Chaves, A.A.: Simple heuristics for the assembly line worker assignment and balancing problem. J. Heuristics 18(3), 505–524 (2012)
Gansterer, M., Hartl, R.F.: One- and two-sided assembly line balancing problems with real-world constraints. Int. J. Prod. Res. 56(8), 3025–3042 (2018)
Ritt, M., Costa, A.M., Miralles, C.: The assembly line worker assignment and balancing problem with stochastic worker availability. Int. J. Prod. Res. 54(3), 907–922 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 IFIP International Federation for Information Processing
About this paper
Cite this paper
Yang, H., Lee, JH., Kim, HJ. (2021). Assembly Line Worker Assignment and Balancing Problem with Positional Constraints. In: Dolgui, A., Bernard, A., Lemoine, D., von Cieminski, G., Romero, D. (eds) Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems. APMS 2021. IFIP Advances in Information and Communication Technology, vol 634. Springer, Cham. https://doi.org/10.1007/978-3-030-85914-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-85914-5_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85913-8
Online ISBN: 978-3-030-85914-5
eBook Packages: Computer ScienceComputer Science (R0)