Paint batching problem on \(M\)-to-1 conveyor systems

DOI10.1016/j.cor.2016.04.019zbMath1349.90284OpenAlexW2342711390MaRDI QIDQ342469

Yong-Hee Han, Sung-Seok Ko, Jin Young Choi

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.04.019

zbMATH Keywords

dynamic programminggenetic algorithm\(M\)-to-1 conveyor systempaint batching problemre-sequencingsetup minimization

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An inexact algorithm for the sequential ordering problem
• A sequential ordering problem in automotive paint shops
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization