A New Mathematical Model for Assembly Line Worker Assignment and Balancing

Öz

Aim of assembly line balancing is to assign the product parts to the workstations that constitute the assembly line. Worker assignment problem is a new problem variety in assembly lines that typically is met in different situations in which the workforce is not homogeneous. This problem is different from the well-known simple assembly line balancing problem from the view point of task execution times of nonhomogeneous workers. In this paper, we introduce a new mathematical formulation with objective function to minimize the cycle time for the assembly line worker assignment and balancing problem (ALWABP). GUROBI solver is used for the problem solution. The mathematical model is examined by using a standard test problem set. As a result of the experiments, it is observed that the proposed mathematical model is more effective in terms of solution quality and CPU time than the current mathematical method.

Anahtar Kelimeler

• Worker assignment,Assembly line balancing,Mathematical modelling

Kaynakça

1. Akyol SD, Baykasoğlu A, 2019. ErgoALWABP: a multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem under ergonomic risk factors. Journal of Intelligence Manufacturing. 30: 291–302.
2. Battaia O, Dolgui A, 2013. A taxonomy of line balancing problems and their solution approaches. International Journal of Production Economics. 142: 259–277.
3. Becker C, Scholl A, 2006. A survey on problems and methods in generalized assembly line balancing. European Journal of Operations Research.168: 694–715.
4. Blum C, Miralles C, 2011. On solving the assembly line worker assignment and balancing problem via beam search. Computers and Operations Research. 38(1): 328–39.
5. Chaves AA, Miralles C, Lorena LAN, 2007. Clustering search approach for the assembly line worker assignment and balancing problem. 37th international conference on computers and industrial engineering, 20-23 October 2007, Alexandria, Egypt.
6. Chaves AA, Lorena LAN, Miralles C, 2009. Hybrid metaheuristic for the assembly line worker assignment and balancing problem. Lecture Notes in Computer Science. 5818: 1–14.
7. Miralles C, Garcia-Sabater JP, Andres C, Cardos M, 2007. Advantages of assembly lines in sheltered work centers for disabled A case study. International Journal of Production Economics. 110(1): 187–197.
8. Miralles C, Garcia-Sabater JP, Andres C, Cardos M, 2008. 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(3): 352– 367.

9. Moreira MCO, Costa AM, 2009. A minimalist yet efficient tabu search for balancing assembly lines with disabled workers. Anaisdo XLI Simposio Brasileiro de Pesquisa Operacional, 1-4 September 2009, Porto Seguro, Brazil.
10. Moreira M, Ritt M, Costa A, Chaves A, 2012. Simple heuristics for the assembly line worker assignment and balancing problem. Journal of Heuristics. 18: 505–524.
11. Mutlu O, Polat O, Supciller A, 2013. An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II. Computers and Operations Research. 40: 418–426.
12. Pereira J, 2018. The robust (minmax regret) assembly line worker assignment and balancing problem. Computers and Operations Research. 93: 27–40.
13. Polat 0, Kalayci CB, Mutlu Ö, Gupta SM, 2016. A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study. International Journal of Production Research. 54:3, 722-741.
14. Vilà M, Pereira J, 2014. A branch-and-bound algorithm for assembly line worker assignment and balancing problems. Computers and Operations Research. 44: 105–114.