2005
DOI: 10.1177/0037549704047604
|View full text |Cite
|
Sign up to set email alerts
|

A Simulation Study for Implementing Color Rescheduling Storage in an Automotive Factory

Abstract: This article outlines a simulation study relating to the design and the implementation of color rescheduling storage (CRS) in an automotive factory. In a painting shop, the colors of vehicles are changed frequently according to the assembly schedule. When the color of a vehicle is changed, the cleaning process of the painting gun is necessary, which generates a cost. The major objective of CRS is to reduce the changeover cost in the painting process by grouping vehicles with the same color. In this article, a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…Spieckermann et al [ 6 ] present a formulation of the color-batching process as a sequential ordering problem and propose a branch-and-bound (B&B) algorithm to find the optimal output sequence with the minimum number of color changes. Moon et al [ 7 ] conduct a simulation study for designing and implementing a color rescheduling storage (CRS) in an automotive factory and suggest some simple fill and release policies for operating the selectivity bank. Hartmann and Runkler [ 8 ] present two ant colony optimization (ACO) algorithms to enhance simple rule-based color-batching methods.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Spieckermann et al [ 6 ] present a formulation of the color-batching process as a sequential ordering problem and propose a branch-and-bound (B&B) algorithm to find the optimal output sequence with the minimum number of color changes. Moon et al [ 7 ] conduct a simulation study for designing and implementing a color rescheduling storage (CRS) in an automotive factory and suggest some simple fill and release policies for operating the selectivity bank. Hartmann and Runkler [ 8 ] present two ant colony optimization (ACO) algorithms to enhance simple rule-based color-batching methods.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Han et al (2003) developed a finite-horizon model for resequencing a set of jobs on a moving assembly line, with the objective of minimising the changeover cost, and determined the optimal solution through simulation. Moon et al (2005) conducted a simulation study related to the design and implementation of colour rescheduling storage (CRS) with a loop buffer in an automotive factory. Moon (2010) investigated the problem of minimising setup costs in resequencing jobs at conveyor junctions with off-line buffers under the FIFO constraint.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Some researchers have studied the colour-batching process using selectivity banks. Moon, Kim, and Song (2005) performed a simulation study for designing and implementing a selectivity bank in the paint shop of an automotive factory. Simple placing and releasing algorithms were applied in operating the selectivity bank.…”
Section: Introductionmentioning
confidence: 99%