Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Blum, Christian (2005): Beam-ACO — Hybridizing Ant colony Opti- mization with Beam Search: An Application to Open Shop Scheduling, Computers & Operations Research, 32 (6): 1565–1591.
Boysen, Nils, Malte Fliedner, and Armin Scholl (2009): Sequencing Mixed-Model Assembly Lines: Survey, Classification and Model Critique, European Journal of Operational Research, 192 (2): 349–373.
Boysen, Nils, Malte Fliedner, and Armin Scholl (2010): Level Scheduling under Limited Resequencing Flexibility, Flexible Services and Manufacturing Journal, 22 (3–4): 236–257.
Choi, Wonjoon and Hyunoh Shin (1997): A Real-Time Sequence Control System for the Level Production of the Automobile Assembly Line, Computers & Industrial Engineering, 33 (3–4): 769–772.
Ding, Fong-Yuen and Hui Sun (2004): Sequence Alteration and Restora- tion Related to Sequenced PartsDelivery on an Automobile Mixed-Model Assembly Line with Multiple Departments, International Journal of Production Research, 42 (8): 1525–1543.
Drexl, Andreas and Alf Kimms (2001): Sequencing Jit Mixed-Model Assembly Lines under Station-Load and Part-Usage Constraints, Management Science, 47 (3): 480–491.
Epping, Thomas, Winfried Hochstättler, and Peter Oertel (2004): Complexity Results on a Paint Shop Problem, Discrete Applied Mathematics, 136 (2–3): 217–226.
Fliedner, Malte and Nil Boysen (2008): Solving the Car Sequencing Problem via Branch Bound, European Journal of Operational Research, 191 (3): 1023–1042.
Gravel, Marc, Caroline Gagne, and Wilson Price (2005): Review and Comparison of Three Methods for the Solution of the Car Sequencing Problem, Journal of the Operational Research Society, 56: 1287–1295.
Gusikhin, Oleg, Rahul Caprihan, and Kathryn E. Stecke (2008): Least In-Sequence Probability Heuristic for Mixed-Volume Production Lines, International Journal of Production Research, 46 (3): 647–673.
Hart, Peter, Nils Nilsson, and Bertram Raphael (1968): A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, 4 (2): 100–107.
Inman, Robert R. (2003): ASRS Sizing for Recreating Automotive Assembly Sequences, International Journal of Production Research, 41 (5): 847–863.
Inman, Robert R. and D. M. Schmeling (2003): Algorithm for Agile Assembling-To-Order in the Automotive Industry, International Journal of Production Research, 41 (16): 3831–3848.
Kis, Tamás (2004): On the Complexity of the Car Sequencing Problem, Operations Research Letters, 32 (4): 331–335.
Kuhn, Harold W. (1955): The Hungarian Method for the Assignment Problem, Naval Research Logistics Quarterly, 2 (1–2): 83–87.
Lahmar, Maher and Saif Benjaafar (2007): Sequencing with Limited Flexibility, IIE Transactions, 39 (10): 937–955.
Lahmar, Maher, Hakan Ergan, and Saif Benjaafar (2003): Resequencing and Feature Assignment on an Automated Assembly Line, IEEE Transactions on Robotics and Automation, 19 (1): 89–102.
Lim, Andrew and Zhou Xu (2009): Searching Optimal Resequencing and Feature Assignment on an Automated Assembly Line, Journal of the Operational Research Society, 60 (3): 361–371.
Lowerre, Bruce T. (1976): The Harpy Speech Recognition System, Ph.D. Thesis, Carnegie Mellon University.
Ow, Peng Si and Thomas E. Morton (1988): Filtered Beam Search in Scheduling, International Journal of Production Research, 26 (1): 35–62.
Parrello, Bruce D., Waldo C. Kabat, and Larry Wos (1986): Job-Shop Scheduling Using Automated Reasoning: A Case Study of the Car- Sequencing Problem, Journal of Automated Reasoning, 2 (1): 1–42.
Sabuncuoglu, Isan, Yasin Gocgun, and Erdal Erel (2008): Backtracking and Exchange of Information: Methods to Enhance a Beam Search Algorithm for Assembly Line Scheduling, European Journal of Operational Research, 186 (3): 915–930.
Solnon, Christine, Van Dat Cung, Alain Nguyen, and Christian Artigues (2008): The Car Sequencing Problem: Overview of State-of-the-Art Methods and Industrial Case-Study of the ROADEF2005 Challenge Problem, European Journal of Operational Research, 191 (3): 912–927.
Spieckermann, Sven, Kai Gutenschwager, and Stefan Voÿ (2004): A Sequential Ordering Problem in Automotive Paint Shops, International Journal of Production Research, 42 (9): 1865–1878.
Wang, Fan and Andrew Lim (2007): A Stochastic Beam Search for the Berth Allocation Problem, Decision Support Systems, 42 (4): 2186–2196.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Boysen, N., Golle, U. & Rothlauf, F. The Car Resequencing Problem with Pull-Off Tables. Bus Res 4, 276–292 (2011). https://doi.org/10.1007/BF03342757
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03342757