The assembly line balancing and scheduling problem with sequence-dependent setup times: Problem extension, model formulation and efficient heuristics

OR Spectrum

Volumn 35, Issue 1, 2013, Pages 291-320

  Scholl, Armin ^a   Boysen, Nils ^a   Fliedner, Malte ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Assembly line balancing; Combinatorial optimization; Mass production; Scheduling; Setup time

Indexed keywords

EID: 84871947722     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-011-0265-0     Document Type: Article

References (37)

1. Allahverdi A, Ng C, Cheng T, Kovalyov M (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3): 985-1032.
2. Andrés C, Miralles C, Pastor R (2008) Balancing and scheduling tasks in assembly lines with sequence-dependent setup times. Eur J Oper Res 187(3): 1212-1223.
3. Arcus A (1966) A computer method of sequencing operations for assembly lines. Int J Prod Res 4: 259-277.
4. Barnes R (1959) Motion and time study. Wiley, New York.
5. Bautista J, Pereira J (2002) Ant algorithms for assembly line balancing. Lecture Notes in Computer Science, vol 2463. pp 65-75.
6. Baybars I (1986) A survey of exact algorithms for the simple assembly line balancing problem. Manag Sci 32: 909-932.
7. Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168: 694-715.
8. Becker C, Scholl A (2009) Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure. Eur J Oper Res 199: 359-374.
9. Boctor F (1995) A multiple-rule heuristic for assembly line balancing. Eur J Oper Res Soc 46: 62-69.
10. Boysen N, Fliedner M (2008) A versatile algorithm for assembly line balancing. Eur J Oper Res 184: 39-55.
11. Boysen N, Fliedner M, Scholl A (2007) A classification of assembly line balancing problems. Eur J Oper Res 183: 674-693.
12. Boysen N, Scholl A (2009) A general solution framework for component commonality problems. BuR Business Res 2(1): 86-106.
13. Dorigo M, Blum C (2005) Ant colony optimization theory: A survey. Theoret Comput Sci 344: 243-278.
14. Dorigo M, Stützle T (2003) The ant colony optimization metaheuristic: algorithms, applications, and advances, vol 57. Springer, New York, pp 250-285.
15. Easton F, Faaland B, Klastorin T, Schmitt T (1989) Improved network based algorithms for the assembly line balancing problem. Int J Prod Res 27: 1901-1915.
16. Erel E, Sarin S (1998) A survey of the assembly line balancing procedures. Prod Plann Control 9: 414-434.
17. Helgeson W, Birnie D (1961) Assembly line balancing using the ranked positional weight technique. J Ind Eng 12(6): 394-398.
18. Jackson J (1956) A computing procedure for a line balancing problem. Manag Sci 2: 261-271.
19. Kanawaty G (1992) Introduction to work study. 4th Int Labour Office, Geneva.
20. Klein M (1963) On assembly line balancing. Oper Res 11: 274-281.
21. Klein R, Scholl A (1999) Computing lower bounds by destructive improvement-an application to resource-constrained project scheduling. Eur J Oper Res 112: 322-346.
22. Little J, Murty K, Sweeney D, Karel C (1963) An algorithm for the traveling salesman problem. Oper Res 11: 972-989.
23. Martino L, Pastor R (2010) Heuristic procedures for solving the general assembly line balancing problem with setups. Int J Prod Res 48(6): 1787-1804.
24. Miller C, Tucker A, Zemlin R (1960) Integer programming formulation of the traveling salesman problem. J Assoc Comput Mach 7: 326-329.
25. Nelder J, Mead R (1965) A simplex method for function minimization. Comput J 7: 308-313.
26. Pastor R, Andrés C, Miralles C (2010) Corrigendum to Balancing and scheduling tasks in assembly lines with sequence-dependent setup. Eur J Oper Res 201: 336-336 (European J Operational Research 187 (2008) 1212-1223).
27. Rekiek B, Dolgui A, Delchambre A, Bratcu A (2002) State of art of optimization methods for assembly line design. Annu Rev Control 26: 163-174.
28. Resende M, RibeiroC(2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics. Kluwer Academic Publishers, Dordrecht, pp 219-249.
29. Scholl A (1999) Balancing and sequencing of assembly lines. 2nd edn. Physica, Heidelberg.
30. Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168: 666-693.
31. Scholl A, Boysen N, Fliedner M (2008) The sequence-dependent assembly line balancing problem. Oper Res Spectrum 30: 579-609.
32. Scholl A, Fliedner M, Boysen N (2010) Absalom: Balancing assembly lines with assignment restrictions. Eur J Oper Res 200(3): 688-701.
33. Scholl A, Klein R (1997) Salome: a bidirectional branch and bound procedure for assembly line balancing. INFORMS J on Comput 9: 319-334.
34. Scholl A, Klein R (1999) Balancing assembly lines effectively-a computational comparison. Eur J Oper Res 114: 50-58.
35. Scholl A, Voß S (1996) Simple assembly line balancing-heuristic approaches. J Heuristics 2: 217-244.
36. Talbot F, Patterson J, Gehrlein W (1986) A comparative evaluation of heuristic line balancing techniques. Manag Sci 32: 430-454.
37. Wilhelm W (1999) A column-generation approach for the assembly system design problem with tool changes. Int J Flexible Manuf Syst 11(2): 177-205.