Document Actions

Operations and Information Systems

The Car Resequencing Problem with Pull-Off Tables

  1. Nils Boysen
  2. Uli Golle
  3. Franz Rothlauf

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

Fulltext

Get the fulltext as pdf.

License

Any party may pass on this Work by electronic means and make it available for download under the terms and conditions of the authorcontract. The text of the license may be accessed and retrieved via Internet at no url given

Number of citations

Visit Google Scholar to find out, how often this paper is cited.

 
Issues 2011
NEW: Volume 4 | Issue 2 | December 2011
PDF Icon Download (PDF - 4,0 MB)
Volume 4 | Issue 1 | March 2011
PDF Icon Download (PDF - 3,0 MB)

Cover Business Research