Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hong, S. | - |
dc.contributor.author | Han, J. | - |
dc.contributor.author | Choi, J.Y. | - |
dc.contributor.author | Lee, K. | - |
dc.date.available | 2019-03-13T01:30:31Z | - |
dc.date.created | 2018-10-18 | - |
dc.date.issued | 2018-12 | - |
dc.identifier.issn | 0307-904X | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/30996 | - |
dc.description.abstract | 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. © 2018 Elsevier Inc. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Elsevier Inc. | - |
dc.relation.isPartOf | Applied Mathematical Modelling | - |
dc.subject | Heuristic algorithms | - |
dc.subject | Paint | - |
dc.subject | Automotive paints | - |
dc.subject | Dynamic programming algorithm | - |
dc.subject | Exact algorithms | - |
dc.subject | Lower bounds | - |
dc.subject | Programming framework | - |
dc.subject | Resequencing | - |
dc.subject | Sequence-dependent changeovers | - |
dc.subject | Upper Bound | - |
dc.subject | Dynamic programming | - |
dc.title | Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.apm.2018.07.035 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | Applied Mathematical Modelling, v.64, pp.285 - 297 | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000447117200017 | - |
dc.identifier.scopusid | 2-s2.0-85051402516 | - |
dc.citation.endPage | 297 | - |
dc.citation.startPage | 285 | - |
dc.citation.title | Applied Mathematical Modelling | - |
dc.citation.volume | 64 | - |
dc.contributor.affiliatedAuthor | Han, J. | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.subject.keywordAuthor | Car resequencing problem | - |
dc.subject.keywordAuthor | Automotive paint shops | - |
dc.subject.keywordAuthor | Dynamic programming | - |
dc.subject.keywordAuthor | Heuristic algorithm | - |
dc.subject.keywordPlus | BATCHING PROBLEM | - |
dc.subject.keywordPlus | SEQUENCE | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.