Paint batching problem on M-to-1 conveyor systems
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 4143778 (Why is no real title available?)
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- scientific article; zbMATH DE number 870411 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- A sequential ordering problem in automotive paint shops
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- An inexact algorithm for the sequential ordering problem
- Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization
Cited in
(3)
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)