Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/103705
Authors: 
Boysen, Nils
Golle, Uli
Rothlauf, Franz
Year of Publication: 
2011
Citation: 
[Journal:] BuR - Business Research [ISSN:] 1866-8658 [Volume:] 4 [Year:] 2011 [Issue:] 2 [Pages:] 276-292
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.
Subjects: 
mixed-model assembly line
car sequencing
resequencing
Persistent Identifier of the first edition: 
Document Type: 
Article

Files in This Item:
File
Size
416.08 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.