Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem
- 37 Downloads
Worker assignment is a relatively new problem in assembly lines that typically is encountered in situations in which the workforce is heterogeneous. The optimal assignment of a heterogeneous workforce is known as the assembly line worker assignment and balancing problem (ALWABP). This problem is different from the well-known simple assembly line balancing problem concerning the task execution times, and it varies according to the assigned worker. Minimal work has been reported in worker assignment in two-sided assembly lines. This research studies worker assignment and line balancing in two-sided assembly lines with an objective of minimizing the cycle time (TALWABP). A mixed-integer programming model is developed, and CPLEX solver is used to solve the small-size problems. An improved migrating birds optimization algorithm is employed to deal with the large-size problems due to the NP-hard nature of the problem. The proposed algorithm utilizes a restart mechanism to avoid being trapped in the local optima. The solutions obtained using the proposed algorithms are compared with well-known metaheuristic algorithms such as artificial bee colony and simulated annealing. Comparative study and statistical analysis indicate that the proposed algorithm can achieve the optimal solutions for small-size problems, and it shows superior performance over benchmark algorithms for large-size problems.
KeywordsAssembly line balancing Two-sided assembly line Worker assignment Migrating birds optimization Metaheuristics
This research is partially supported by National Science Foundation of China under grant 61803287 and China Postdoctoral Science Foundation under grant 2018M642928.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Akyol SD, Baykasoğlu A (2016) A multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem. J Intell Manuf 1–17. https://doi.org/10.1007/s10845-016-1262-6
- Al-Janabi S, Alwan E (2017) Soft mathematical system to solve black box problem through development the FARB based on hyperbolic and polynomial functions. In: 2017 10th international conference on Developments in eSystems Engineering (DeSE). IEEE, pp 37–42Google Scholar
- Chaves AA, Miralles C, Lorena LAN (2007) Clustering search approach for the assembly line worker assignment and balancing problem. In: Proceedings of the 37th international conference on computers and industrial engineering, Alexandria, Egypt, pp 1469–1478Google Scholar
- Chaves AA, Lorena LAN, Miralles C (2009) Hybrid metaheuristic for the assembly line worker assignment and balancing problem. In: Blesa MJ, Blum C, Di Gaspero L, Roli A, Sampels M, Schaerf A (eds) Hybrid metaheuristics: 6th International Workshop, HM 2009, Udine, Italy, 16–17 October 2009. Proceedings. Springer, Berlin, Heidelberg, pp 1–14. https://doi.org/10.1007/978-3-642-04918-7_1
- Fattahi P, Samoei P, Zandieh M (2016) Simultaneous multi-skilled worker assignment and mixed-model two-sided assembly line balancing. Int J Eng Trans B Appl 29:211Google Scholar
- Janardhanan MN, Li Z, Nielsen P, Tang Q (2018) Artificial bee colony algorithms for two-sided assembly line worker assignment and balancing problem. In: Omatu S, Rodríguez S, Villarrubia G, Faria P, Sitek P, Prieto J (eds) Distributed computing and artificial intelligence, 14th International Conference. Springer, Cham, pp 11–18. https://doi.org/10.1007/978-3-319-62410-5_2
- Miralles C, García-Sabater JP, Andrés C, Cardós M (2008) 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. https://doi.org/10.1016/j.dam.2005.12.012 MathSciNetCrossRefzbMATHGoogle Scholar