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

Full description

Saved in:

Bibliographic Details
Published in:	Applied Mathematical Modelling Vol. 64; p. 285
Main Authors:	Hong, Sungwon, Han, Jinil, Choi, Jin Young, Lee, Kyungsik
Format:	Journal Article
Language:	English
Published:	New York Elsevier BV 01.12.2018
Subjects:	Algorithms Automotive repair services Combinatorial analysis Conveyors Dynamic programming Heuristic Lower bounds Paints Upper bounds
ISSN:	1088-8691, 0307-904X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!