Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops

DOI10.1016/J.APM.2018.07.035MaRDI QIDQ2307010zbMATH OpenOpenAlexWikidataFDO

Authors Sungwon Hong, Jinil Han, Kyungsik Lee, Jin Young Choi

Publication date 27 March 2020

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2018.07.035

zbMATH Keywords

automotive paint shopscar resequencing problemdynamic programmingheuristic algorithm

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Soft car sequencing with colors: lower bounds and optimality proofs
• Review and comparison of three methods for the solution of the car sequencing problem
• scientific article; zbMATH DE number 7403863
• Local search and suffix tree for car-sequencing problem with colors
• Paint batching problem on M-to-1 conveyor systems

Cites work

• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• A sequential ordering problem in automotive paint shops
• Complexity results on a paint shop problem.
• Group-shop scheduling with sequence-dependent set-up and transportation times
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
• Integer Programming
• Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization
• Paint batching problem on M-to-1 conveyor systems
• Some results on a paint shop problem for words
• Sorting with line storage systems

Cited in

(7)

• Small-world optimization algorithm and its application in a sequencing problem of painted body storage in a car company
• scientific article; zbMATH DE number 7403863 (Why is no real title available?)
• Paint batching problem on M-to-1 conveyor systems
• Searching optimal resequencing and feature assignment on an automated assembly line
• Sorting with line storage systems
• An efficient heuristic for a real-life OAS problem
• Solving the paint shop problem with flexible management of multi-lane buffers using reinforcement learning and action masking

This page was built for publication: Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2307010)