Janardhanan, Mukund Nilakantan

Li, Zixiang

Nielsen, Peter

English

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.</p

Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem

https://vbn.aau.dk/ws/files/335129057/Revised_Manuscript_SOCO.pdf

Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem

Abstract

Similar works

Full text

Available Versions

VBN