Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/103705 
Erscheinungsjahr: 
2011
Quellenangabe: 
[Journal:] BuR - Business Research [ISSN:] 1866-8658 [Volume:] 4 [Issue:] 2 [Publisher:] VHB - Verband der Hochschullehrer für Betriebswirtschaft, German Academic Association of Business Research [Place:] Göttingen [Year:] 2011 [Pages:] 276-292
Verlag: 
VHB - Verband der Hochschullehrer für Betriebswirtschaft, German Academic Association of Business Research, Göttingen
Zusammenfassung: 
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.
Schlagwörter: 
mixed-model assembly line
car sequencing
resequencing
Persistent Identifier der Erstveröffentlichung: 
Dokumentart: 
Article

Datei(en):
Datei
Größe
416.08 kB





Publikationen in EconStor sind urheberrechtlich geschützt.