Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops

In this paper, a car resequencing problem (CRP) for automotive paint shops is considered, whereby a set of cars conveyed from an upstream shop to one of the multiple conveyors is retrieved sequentially before the painting operation. The aim of the CRP is to find a car retrieval sequence that minimiz...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied Mathematical Modelling Ročník 64; s. 285
Hlavní autoři: Hong, Sungwon, Han, Jinil, Choi, Jin Young, Lee, Kyungsik
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier BV 01.12.2018
Témata:
Algorithms
Automotive repair services
Combinatorial analysis
Conveyors
Dynamic programming
Heuristic
Lower bounds
Paints
Upper bounds
ISSN:1088-8691, 0307-904X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, a car resequencing problem (CRP) for automotive paint shops is considered, whereby a set of cars conveyed from an upstream shop to one of the multiple conveyors is retrieved sequentially before the painting operation. The aim of the CRP is to find a car retrieval sequence that minimizes the sequence-dependent changeover cost, which is the cost that is incurred when two consecutive cars do not share the same color. For this problem, we propose accelerated dynamic programming (ADP) algorithms that utilize strong combinatorial lower bounds and effective upper bounds in a standard dynamic programming framework, thus outperforming existing exact algorithms. Testing of our algorithms over a wide range of instances confirmed that they are more efficient than the existing approaches and are also more applicable in practice.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1088-8691
0307-904X
DOI:10.1016/j.apm.2018.07.035