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!
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.
AbstractList 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.
Author Han, Jinil
Hong, Sungwon
Choi, Jin Young
Lee, Kyungsik
Author_xml – sequence: 1
  givenname: Sungwon
  surname: Hong
  fullname: Hong, Sungwon
– sequence: 2
  givenname: Jinil
  surname: Han
  fullname: Han, Jinil
– sequence: 3
  givenname: Jin
  surname: Choi
  middlename: Young
  fullname: Choi, Jin Young
– sequence: 4
  givenname: Kyungsik
  surname: Lee
  fullname: Lee, Kyungsik
BookMark eNotjl1LwzAYhYNMcJv-AO8CXre-SdY0vRxDnTDwRsG7kaZvto4mqUkm-O-tH1eHAw_nPAsy88EjIbcMSgZM3p9KPbqSA1Ml1CWI6oLMQUBdNLB6n5E5A6UKJRt2RRYpnQAYVxLmxKyNwQGjztjR7str1xs6xnCI2rneH6geDiH2-egStSFSTY2ONGLCjzN680NMdDugo72n-pyDC7n_RDrq3meajmFM1-TS6iHhzX8uydvjw-tmW-xenp43611hBK9yUVujGg226kAoDrJliK1lLbZdLbvfymUzIShqA-3KSmaMkFg10HDeWbEkd3-7k9Fkl_L-FM7RT5d7zriooQLViG8YhVyG
CitedBy_id crossref_primary_10_1016_j_cie_2022_108144
crossref_primary_10_1080_00207543_2021_1933644
crossref_primary_10_1080_00207543_2022_2098871
crossref_primary_10_1016_j_cie_2024_110151
crossref_primary_10_3390_app14177435
crossref_primary_10_1016_j_compchemeng_2024_108682
crossref_primary_10_1016_j_eswa_2023_121825
crossref_primary_10_1016_j_cie_2020_107008
crossref_primary_10_1016_j_jmsy_2020_06_001
crossref_primary_10_1155_2021_3534210
crossref_primary_10_1016_j_cie_2024_109990
crossref_primary_10_3390_app14083498
crossref_primary_10_1287_ijoc_2024_0904
crossref_primary_10_1109_TASE_2024_3415075
ContentType Journal Article
Copyright Copyright Elsevier BV Dec 2018
Copyright_xml – notice: Copyright Elsevier BV Dec 2018
DBID 7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.apm.2018.07.035
DatabaseName Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Psychology
Mathematics
EISSN 0307-904X
GroupedDBID -W8
-~X
.7I
.GO
.QK
0BK
0R~
23M
2DF
4.4
53G
5GY
6J9
7SC
8FD
8VB
AAGDL
AAGZJ
AAHIA
AAHSB
AAMFJ
AAMIU
AAPUL
AATTQ
AAZMC
ABCCY
ABDBF
ABFIM
ABIVO
ABJNI
ABLIJ
ABPEM
ABRYG
ABTAI
ABXUL
ABXYU
ABZLS
ACGFS
ACGOD
ACHQT
ACTIO
ACTOA
ACUHS
ADAHI
ADCVX
ADKVQ
AECIN
AEFOU
AEGXH
AEISY
AEKEX
AEMOZ
AEMXT
AEOZL
AEPSL
AEYOC
AEZRU
AFHDM
AFRVT
AGDLA
AGMYJ
AGRBW
AHDZW
AHQJS
AIJEM
AIYEW
AJWEG
AKBVH
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AVBZW
AWYRJ
BEJHT
BLEHA
BMOTO
BOHLJ
CCCUG
CQ1
CS3
DGFLZ
DKSSO
EAP
EBR
EBS
EBU
EDJ
EJD
EMK
EPL
EPS
EST
ESX
E~B
E~C
F5P
FEDTE
G-F
GTTXZ
H13
HF~
HVGLF
HZ~
J.O
JQ2
K1G
KYCEM
L7M
L~C
L~D
M4Z
NA5
O9-
P2P
PQQKQ
QWB
RNANH
ROSJB
RSYQP
S-F
STATR
TASJS
TBQAZ
TDBHL
TEH
TFH
TFL
TFW
TH9
TNTFI
TRJHH
TUROJ
TUS
TWZ
UPT
UT5
UT9
VAE
ZL0
~01
~S~
ID FETCH-LOGICAL-c325t-7fc89a0f5d038206b1eebf1bebd76d6b1ee26989ae37c0b4f61cc36e590922df3
ISICitedReferencesCount 19
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000447117200017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1088-8691
IngestDate Wed Aug 13 09:14:37 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c325t-7fc89a0f5d038206b1eebf1bebd76d6b1ee26989ae37c0b4f61cc36e590922df3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2123705089
PQPubID 2045280
ParticipantIDs proquest_journals_2123705089
PublicationCentury 2000
PublicationDate 20181201
PublicationDateYYYYMMDD 2018-12-01
PublicationDate_xml – month: 12
  year: 2018
  text: 20181201
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Applied Mathematical Modelling
PublicationYear 2018
Publisher Elsevier BV
Publisher_xml – name: Elsevier BV
SSID ssj0012860
ssj0005904
Score 2.345155
Snippet 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...
SourceID proquest
SourceType Aggregation Database
StartPage 285
SubjectTerms Algorithms
Automotive repair services
Combinatorial analysis
Conveyors
Dynamic programming
Heuristic
Lower bounds
Paints
Upper bounds
Title Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
URI https://www.proquest.com/docview/2123705089
Volume 64
WOSCitedRecordID wos000447117200017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 0307-904X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012860
  issn: 1088-8691
  databaseCode: TFW
  dateStart: 19970301
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FwqEcEBQQlLbaA-JiubLXzz1WVaOKlsDBhdyi9e6aGILjxm5o_wc_uLMPx6aVEBy4WM5asmLP55nZmW9mEHpLWCgkYYXLc0LdUKTUZRQ-vFhlhfJISBFxPWwimUzS6ZR-Go1-dbUw60VSVen1Na3_q6hhDYStSmf_Qdybm8ICnIPQ4Qhih-NfCf6IczAlqgOEcISZN9-xsH7oisTF1-WqbOemE4MqjmQrRxUhaU61KU7XQ2ZUKIRdtZqut5ZOzcqqdZr5sm6GHm3nxn7Y9H9V1b5qvs6is4qanWvD0qBbfvaZ_1MTfn1fVj3T43i-LO2io3VRd8Fyhs5uYK0pvw_jFX56h_vRF9J8Hqhd0HVuGpu5XYfS1nN5iUs9w9_sdHUcDpWtGfZzzwiYeMS3Q1arVgN-qruzmqYovzfcnnycjS_Oz2fZyTR7V1-6ahaZytnbwSwP0EOSRFQRBbPxl544RNUO1iaqSGoK0bsH6BLnmkJ45w_cM_fah8meoid284GPDGieoZGsdtDjXnLNDtreWMSb54gPsIQtlvAAS7jHEgYsYYYBS3iIJWyxhMsK91jCGktYY-kFuhifZMenrp3K4fKARK2bFDylzCsi4QWq-X_uS5kXfi5zkcRC_yRqKimTQcK9PCxin_MglvDaKCGiCF6irWpZyVcIUxH4YZ6HEUnAkfQCFntC8IIwAtt-wYrXaK97YTP7hTUz5WslHuwr6O6fL79B2z3-9tBWu7qS--gRX7dlszrQMr0FFql6-A
linkProvider Taylor & Francis
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Accelerated+dynamic+programming+algorithms+for+a+car+resequencing+problem+in+automotive+paint+shops&rft.jtitle=Applied+Mathematical+Modelling&rft.au=Hong%2C+Sungwon&rft.au=Han%2C+Jinil&rft.au=Choi%2C+Jin+Young&rft.au=Lee%2C+Kyungsik&rft.date=2018-12-01&rft.pub=Elsevier+BV&rft.issn=1088-8691&rft.eissn=0307-904X&rft.volume=64&rft.spage=285&rft_id=info:doi/10.1016%2Fj.apm.2018.07.035&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1088-8691&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1088-8691&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1088-8691&client=summon