Empirical evaluation of lower bounding methods for the simple assembly line balancing problem

The simple assembly line balancing problem (SALBP) is a classical problem that arises in the design of assembly lines. The objective of the SALBP is to divide the assembly work among different workstations of the assembly line in order to maximise the efficiency of the entire line. In this paper, we: (a) put forward different families of lower bounds for the SALBP; (b) introduce new lower bounds; (c) generalise previous results; and (d) analyse the performance of these lower bounding techniques in terms of solution quality using a recently proposed set of instances. An analysis of the results of these bounds leads us to: (1) improve the best-known lower bound for 104 out of the 175 open instances from the benchmark set; (2) identify the areas of applicability of different sources of bounds; and (3) identify possible uses of these bounds in other assembly line balancing problems.

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

[2]  Roger V. Johnson,et al.  Optimally balancing large assembly lines with `FABLE' , 1988 .

[3]  Gilbert Laporte,et al.  Branch-and-bound algorithms for the multi-product assembly line balancing problem , 1989 .

[4]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[5]  Gilbert Laporte,et al.  Capacitated Vehicle Routing on Trees , 1991, Oper. Res..

[6]  Alain Delchambre,et al.  A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[7]  Eugeniusz Nowicki,et al.  An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times , 1994, Discret. Appl. Math..

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

[9]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

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

[11]  Sándor P. Fekete,et al.  New Classes of Lower Bounds for Bin Packing Problems , 1998, IPCO.

[12]  Philip H. Ramsey.  Nonparametric Statistical Methods , 1974, Technometrics.

[13]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[14]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

[15]  José Fernando Gonçalves,et al.  A Hybrid Genetic Algorithm for Assembly Line Balancing , 2002, J. Heuristics.

[16]  Krzysztof Fleszar,et al.  An enumerative heuristic and reduction methods for the assembly line balancing problem , 2003, Eur. J. Oper. Res..

[17]  Angel B. Ruiz,et al.  Balancing assembly lines with tabu search , 2006, Eur. J. Oper. Res..

[18]  Zeger Degraeve,et al.  An linear programming based lower bound for the simple assembly line balancing problem , 2006, Eur. J. Oper. Res..

[19]  Joaquín Bautista,et al.  Beam-ACO Applied to Assembly Line Balancing , 2006, ANTS Workshop.

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

[21]  Teodor Gabriel Crainic,et al.  New bin packing fast lower bounds , 2007, Comput. Oper. Res..

[22]  Christian Blum,et al.  Beam-ACO for Simple Assembly Line Balancing , 2008, INFORMS J. Comput..

[23]  Rafael Pastor,et al.  An improved mathematical program to solve the simple assembly line balancing problem , 2009 .

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

[25]  Joaquín Bautista,et al.  A dynamic programming based heuristic for the assembly line balancing problem , 2009, Eur. J. Oper. Res..

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

[27]  Joaquín Bautista,et al.  Procedures for the Time and Space constrained Assembly Line Balancing Problem , 2011, Eur. J. Oper. Res..

[28]  Sheldon Howard Jacobson,et al.  A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem , 2012, INFORMS J. Comput..

[29]  Armin Scholl,et al.  Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing , 2013, Eur. J. Oper. Res..

[30]  Jordi Pereira,et al.  An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time , 2013, Eur. J. Oper. Res..

[31]  Alexandre Dolgui,et al.  A taxonomy of line balancing problems and their solutionapproaches , 2013 .

[32]  Manochehr Manteghi,et al.  The Automotive Industry , 2013 .

[33]  Johannes Sternatz,et al.  Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry , 2014, Eur. J. Oper. Res..

[34]  Jie Gao,et al.  Balancing mixed-model assembly lines with adjacent task duplication , 2014 .

[35]  Sheldon H. Jacobson,et al.  An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset , 2014, Eur. J. Oper. Res..

[36]  Marcus Ritt,et al.  A heuristic and a branch-and-bound algorithm for the Assembly Line Worker Assignment and Balancing Problem , 2014, Comput. Oper. Res..

[37]  Jordi Pereira,et al.  A branch-and-bound algorithm for assembly line worker assignment and balancing problems , 2014, Comput. Oper. Res..

[38]  Jessica Schulze,et al.  Balancing And Sequencing Of Assembly Lines , 2016 .

[39]  João Pedro Pedroso,et al.  Bin packing and related problems: General arc-flow formulation with graph compression , 2013, Comput. Oper. Res..

[40]  Michael Mutingi,et al.  Assembly Line Balancing , 2017 .