The Car Resequencing Problem with Pull-Off Tables

BuR Business Research Journal, Vol. 4, No. 2, pp. 276-292, December 2011

17 Pages Posted: 3 Jan 2012

See all articles by N. Boysen

N. Boysen

University of Jena

Uli Golle

Johannes Gutenberg University Mainz

Franz Rothlauf

Johannes Gutenberg University Mainz

Date Written: December 19, 2011

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.

Keywords: mixed-model assembly line, car sequencing, resequencing

JEL Classification: C61, M11, L62

Suggested Citation

Boysen, Nils and Golle, Uli and Rothlauf, Franz, The Car Resequencing Problem with Pull-Off Tables (December 19, 2011). BuR Business Research Journal, Vol. 4, No. 2, pp. 276-292, December 2011, Available at SSRN: https://ssrn.com/abstract=1978678

Nils Boysen (Contact Author)

University of Jena ( email )

Jena

Uli Golle

Johannes Gutenberg University Mainz ( email )

Saarstrasse 21
Mainz, D-55099
Germany

Franz Rothlauf

Johannes Gutenberg University Mainz ( email )

Saarstrasse 21
Mainz, D-55099
Germany

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
90
Abstract Views
801
Rank
481,263
PlumX Metrics