A sequential ordering problem in automotive paint shops.
Saved in:
| Title: | A sequential ordering problem in automotive paint shops. |
|---|---|
| Authors: | Spieckermann, S.1 (AUTHOR), Gutenschwager, K.2 (AUTHOR), Voß, S.3 (AUTHOR) |
| Source: | International Journal of Production Research. 5/1/2004, Vol. 42 Issue 9, p1865-1878. 14p. 4 Diagrams, 4 Charts, 1 Graph. |
| Subjects: | Automotive painting & paint shops, Sequential scheduling, Industrial costs, Paint shops, Batch processing, Manufacturing processes, Industrial engineering |
| Abstract: | In paint shops in the automotive industry, a change of colours between two consecutive cars causes sequence-dependent set-up costs. Often, selectivity banks are used as storage and retrieval systems to create colour-oriented batches of cars before the paint application in order to reduce set-up costs. The efficient control of those selectivity banks is considered a major problem of operating paint shop systems. A branch&bound approach for the colour batching process is presented. Some computational results obtained with the approach are described. An additional focus is to outline the characteristics of parts of the colour-batching problem in selectivity banks as a sequential ordering problem. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In paint shops in the automotive industry, a change of colours between two consecutive cars causes sequence-dependent set-up costs. Often, selectivity banks are used as storage and retrieval systems to create colour-oriented batches of cars before the paint application in order to reduce set-up costs. The efficient control of those selectivity banks is considered a major problem of operating paint shop systems. A branch&bound approach for the colour batching process is presented. Some computational results obtained with the approach are described. An additional focus is to outline the characteristics of parts of the colour-batching problem in selectivity banks as a sequential ordering problem. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00207543 |
| DOI: | 10.1080/00207540310001646821 |
