A branch-and-bound algorithm for assembly line worker assignment and balancing problems

Computers and Operations Research

Volumn 44, Issue , 2014, Pages 105-114

  Vilà, Mariona ^a   Pereira, Jordi ^a,b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSIDAD CATÓLICA DEL NORTE   (Chile)

Author keywords

Assembly line balancing; Branch and bound; Manufacturing

Indexed keywords

ASSEMBLY LINE BALANCING; ASSEMBLY LINE BALANCING PROBLEMS; ASSEMBLY-LINE WORKERS; BALANCING PROBLEMS; BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; OPTIMAL PARTITIONS; OPTIMAL SOLUTIONS;

ALGORITHMS; ASSEMBLY; ASSEMBLY MACHINES; MANUFACTURE;

PROBLEM SOLVING;

EID: 84888215608     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.10.016     Document Type: Article

References (32)

1. A. Scholl, and C. Becker State-of-the-art exact and heuristic solution procedures for simple assembly line balancing Eur J Oper Res 168 2006 666 693 (Pubitemid 41336586)
2. M. Garey, and D.S. Johnson Computers and intractability a guide to the theory of NP-completeness 1979 W.H. Freeman and Company
3. N. Boysen, M. Fliedner, and A. Scholl A classification of assembly line balancing problems Eur J Oper Res 183 2007 674 693 (Pubitemid 46891133)
4. O. Battaïa, and A. Dolgui A taxonomy of line balancing problems and their solution approaches Int J Prod Econ 142 2013 259 277
5. C. Heimlern, and R. Kolisch Work assignment to and qualification of multi-skilled human resources under knowledge depreciation and company skill level targets Int J Prod Res 48 2010 3759 3781
6. J. Rubinovitz, J. Bukchin, and E. Lenz RALB a heuristic algorithm for design and balancing of robotic assembly lines CIRP Ann Manuf Technol 42 1993 497 500 (Pubitemid 23678986)
7. C. Miralles, J.P. García-Sabater, C. Andrés, and M. Cardos Advantages of assembly lines in sheltered work centres for disabled a case study Int J Prod Econ 110 2007 187 197 (Pubitemid 47380293)
8. E.C. Sewell, and S.H. Jacobson A branch, bound, and remember algorithm for the simple assembly line balancing problem INFORMS J Comput 24 2012 433 442
9. C. Blum, and C. Miralles On solving the assembly line worker assignment and balancing problem via beam search Comput Oper Res 38 2011 328 339
10. M.C.O. Moreira, M. Ritt, A.M. Costa, and A.A. Chaves Simple heuristics for the assembly line worker assignment and balancing problem J Heuristics 18 2012 505 524
11. Ö. Mutlu, O. Polat, and A.A. Supciller An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II Comput Oper Res 40 2013 418 426
12. Borba L, Ritt M. Exact and heuristic methods for the assembly line worker assignment and balancing problem. Comput Oper Res, arXiv:1007.4063v1, http://arxiv.org/abs/1308.0299, submitted for publication [retrieved on september 6th 2013].
13. G. Levitin, J. Rubinovitz, and B. Shnits A genetic algorithm for robotic assembly line balancing Eur J Oper Res 168 2006 811 825 (Pubitemid 41336594)
14. J. Gao, L. Sun, L. Wang, and M. Gen An efficient approach for type II robotic assembly line balancing problems Comput Ind Eng 56 2009 1065 1080
15. N. Mladenović, and P. Hansen Variable neighborhood search Comput Oper Res 24 1997 1097 1100
16. C. Miralles, J.P. García-Sabater, C. Andrés, and M. Cardos 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 2008 352 367
17. Chaves AA, Miralles C, Nogueira Lorena LA. 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; 2007. p. 1469-78.
18. S. Martello, F. Soumis, and P. Toth Exact and approximation algorithms for makespan minimization on unrelated parallel machines Discrete Appl Math 75 1997 169 188 (Pubitemid 127410571)
19. A. Scholl, and R. Klein Salome a bidirectional branch and bound procedure for assembly line balancing INFORMS J Comput 9 1997 319 334 (Pubitemid 127697778)
20. M. Vilà, and J. Pereira An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time Eur J Oper Res 229 2013 106 113
21. S. Martello, and P. Toth Knapsack problems algorithms and computer implementations 1990 John Wiley & Sons
22. R.V. Johnson Optimally balancing large assembly lines with 'fable' Manage Sci 34 1988 240 253
23. A. Wotzlaw Scheduling unrelated parallel machines algorithms. Complexity and performance 2012 AV AkademikerVerlag
24. A.M. Geoffrion Lagrangian relaxation and its uses in integer programming Math Prog 2 1974 82 114
25. R. Burkard, M. Dell'Amico, and S. Martello Assignment problems 2009 Society for Industrial and Applied Mathematics
26. ti scheduling problem J Sched 12 2009 163 175
27. M.L. Fisher The lagrangian relaxation method for solving integer programming problems Manage Sci 27 1981 1 18
28. S.L. Van de Velde Duality-based algorithms for scheduling unrelated parallel machines ORSA J Comput 5 1993 192 205
29. R. Jonker, and A. Volgenant A shortest augmenting path algorithm for dense and sparse linear assignment problems Computing 38 1987 325 340 (Pubitemid 17658282)
30. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to algorithms 3rd ed. 2009 The MIT Press
31. J.R. Jackson A computing procedure for a line balancing problem Manage Sci 2 1956 261 271
32. J. Bautista, and J. Pereira Procedures for the time and space constrained assembly line balancing problem Eur J Oper Res 212 2011 473 481