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

AbstractAssembly line balancing problems (ALBP) consist of distributing the total workload for manufacturing any unit of the products to be assembled among the work stations along a manufacturing line as used in the automotive or the electronics industries. Usually, theory assumes that, within each station, tasks can be executed in an arbitrary precedence-feasible sequence without changing station times. In practice, however, the task sequence may influence the station time considerably as sequence-dependent setups (e.g., walking distances, tool changes) have to be considered. Including this aspect leads to a joint balancing and scheduling problem, which we call SUALBSP (setup assembly line balancing and scheduling problem). In this paper, we modify the problem by modeling setups more realistically, give a new, more compact mathematical model formulation and develop effective heuristic solution procedures. Computational experiments based on existing and new data sets indicate that the new procedures outperform formerly proposed heuristics. They are able to solve problem instances of real-world size with small deviations from optimality in computation times short enough to be accepted in real-world decision support systems.

[1]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[2]  Frederick Easton,et al.  Improved network based algorithms for the assembly line balancing problem , 1989 .

[3]  William V. Gehrlein,et al.  A comparative evaluation of heuristic line balancing techniques , 1986 .

[4]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[5]  Armin Scholl,et al.  Balancing assembly lines effectively - A computational comparison , 1999, Eur. J. Oper. Res..

[6]  Armin Scholl,et al.  SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing , 1997, INFORMS J. Comput..

[7]  Nils Boysen,et al.  Absalom: Balancing assembly lines with assignment restrictions , 2010, Eur. J. Oper. Res..

[8]  Armin Scholl,et al.  Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure , 2009, Eur. J. Oper. Res..

[9]  Armin Scholl,et al.  Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling , 1999, Eur. J. Oper. Res..

[10]  James R. Jackson,et al.  A Computing Procedure for a Line Balancing Problem , 1956 .

[11]  Joaquín Bautista,et al.  Ant Algorithms for Assembly Line Balancing , 2002, Ant Algorithms.

[12]  George Kanawaty,et al.  Introduction to work study , 1992 .

[13]  Armin Scholl,et al.  State-of-the-art exact and heuristic solution procedures for simple assembly line balancing , 2006, Eur. J. Oper. Res..

[14]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[15]  A. L. Arcus,et al.  COMSOAL: a computer method of sequencing operations for assembly lines , 1965 .

[16]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[17]  Brahim Rekiek,et al.  State of art of optimization methods for assembly line design , 2002, Annu. Rev. Control..

[18]  Armin Scholl,et al.  A survey on problems and methods in generalized assembly line balancing , 2006, Eur. J. Oper. Res..

[19]  Rafael Pastor,et al.  Heuristic procedures for solving the general assembly line balancing problem with setups , 2010 .

[20]  Morton Klein On Assembly Line Balancing , 1963 .

[21]  Nils Boysen,et al.  Jena Research Papers in Business and Economics A general solution framework for component commonality problems , 2008 .

[22]  George Kanawaty,et al.  Introduction to work study. 4th revised edition , 1992 .

[23]  R. Barnes Motion and time study , 1950 .

[24]  Subhash C. Sarin,et al.  A survey of the assembly line balancing procedures , 1998 .

[25]  Carlos Andrés,et al.  Balancing and scheduling tasks in assembly lines with sequence-dependent setup times , 2008, Eur. J. Oper. Res..

[26]  Nils Boysen,et al.  A versatile algorithm for assembly line balancing , 2008, Eur. J. Oper. Res..

[27]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[28]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[29]  Fayez F. Boctor,et al.  A Multiple-rule Heuristic for Assembly Line Balancing , 1995 .

[30]  Nils Boysen,et al.  A classification of assembly line balancing problems , 2007, Eur. J. Oper. Res..

[31]  Armin Scholl,et al.  Balancing and Sequencing of Assembly Lines , 1995 .

[32]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[33]  Ilker Baybars,et al.  A survey of exact algorithms for the simple assembly line balancing , 1986 .

[34]  Nils Boysen,et al.  The sequence-dependent assembly line balancing problem , 2008, OR Spectr..

[35]  Armin Scholl,et al.  Simple assembly line balancing—Heuristic approaches , 1997, J. Heuristics.

[36]  Wilbert E. Wilhelm,et al.  A Column-Generation Approach for the Assembly System Design Problem with Tool Changes , 1999 .

[37]  Carlos Andrés,et al.  Corrigendum to "Balancing and scheduling tasks in assembly lines with sequence-dependent setup" [European Journal of Operational Research 187 (2008) 1212-1223] , 2010, Eur. J. Oper. Res..