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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied Mathematical Modelling Jg. 64; S. 285
Hauptverfasser:	Hong, Sungwon, Han, Jinil, Choi, Jin Young, Lee, Kyungsik
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier BV 01.12.2018
Schlagworte:	Algorithms Automotive repair services Combinatorial analysis Conveyors Dynamic programming Heuristic Lower bounds Paints Upper bounds
ISSN:	1088-8691, 0307-904X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!