The Car Resequencing Problem with Pull-Off Tables

The car sequencing problem determines sequences of different car models launched down a mixed- model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.

[1]  Ihsan Sabuncuoglu,et al.  Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling , 2008, Eur. J. Oper. Res..

[2]  Marc Gravel,et al.  Review and comparison of three methods for the solution of the car sequencing problem , 2005, J. Oper. Res. Soc..

[3]  Nils Boysen,et al.  Level scheduling under limited resequencing flexibility , 2010 .

[4]  Alf Kimms,et al.  Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints , 2001, Manag. Sci..

[5]  Wonjoon Choi,et al.  A real-time sequence control system for the level production of the automobile assembly line , 1997 .

[6]  Saif Benjaafar,et al.  Sequencing with limited flexibility , 2007 .

[7]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[8]  Tamás Kis,et al.  On the complexity of the car sequencing problem , 2004, Oper. Res. Lett..

[9]  Waldo C. Kabat,et al.  Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem , 2004, Journal of Automated Reasoning.

[10]  Sven Spieckermann,et al.  A sequential ordering problem in automotive paint shops , 2004 .

[11]  Robert R. Inman,et al.  ASRS sizing for recreating automotive assembly sequences , 2003 .

[12]  Andrew Lim,et al.  A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..

[13]  Nils Boysen,et al.  Solving the car sequencing problem via Branch & Bound , 2008, Eur. J. Oper. Res..

[14]  Saif Benjaafar,et al.  Resequencing and feature assignment on an automated assembly line , 2003, IEEE Trans. Robotics Autom..

[15]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[16]  F.-Y. Ding,et al.  Sequence alteration and restoration related to sequenced parts delivery on an automobile mixed-model assembly line with multiple departments , 2004 .

[17]  Andrew Lim,et al.  Searching optimal resequencing and feature assignment on an automated assembly line , 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).

[18]  Robert R. Inman,et al.  Algorithm for agile assembling-to-order in the automotive industry , 2003 .

[19]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[20]  Christine Solnon,et al.  The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem , 2008, Eur. J. Oper. Res..

[21]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[22]  Kathryn E. Stecke,et al.  Least in-sequence probability heuristic for mixed-volume production lines , 2008 .

[23]  Winfried Hochstättler,et al.  Complexity results on a paint shop problem , 2004, Discret. Appl. Math..

[24]  H. Lorenz,et al.  Jena Research Papers in Business and Economics Sequencing Mixed-Model Assembly Lines : Survey , Classification and Model Critique , 2007 .

[25]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .