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

Podrobná bibliografia

Vydané v:	Applied Mathematical Modelling Ročník 64; s. 285
Hlavní autori:	Hong, Sungwon, Han, Jinil, Choi, Jin Young, Lee, Kyungsik
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier BV 01.12.2018
Predmet:	Algorithms Automotive repair services Combinatorial analysis Conveyors Dynamic programming Heuristic Lower bounds Paints Upper bounds
ISSN:	1088-8691, 0307-904X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!