Paint batching problem on M-to-1 conveyor systems

DOI10.1016/J.COR.2016.04.019zbMATH Open1349.90284OpenAlexW2342711390MaRDI QIDQ342469FDOQ342469

Authors: Sung-Seok Ko, Yong-Hee Han, 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

Recommendations

• A sequential ordering problem in automotive paint shops
• Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
• Mixed-Model Sequencing to Minimize Utility Work and the Risk of Conveyor Stoppage
• Sequencing jobs on an automobile assembly line: objectives and procedures
• Multiproduct batching and scheduling with buffered rework: the case of a car paint shop

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) Dynamic programming (90C39) Production models (90B30)

Cites Work

• An inexact algorithm for the sequential ordering problem
• Title not available (Why is that?)
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• Title not available (Why is that?)
• A sequential ordering problem in automotive paint shops
• Title not available (Why is that?)
• Title not available (Why is that?)
• Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization

Cited In (3)

• A sequential ordering problem in automotive paint shops
• Searching optimal resequencing and feature assignment on an automated assembly line
• Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops

This page was built for publication: Paint batching problem on \(M\)-to-1 conveyor systems

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