A sequential ordering problem in automotive paint shops

DOI10.1080/00207540310001646821zbMath1094.90018OpenAlexW2142215646MaRDI QIDQ3159669

Kai Gutenschwager, Stefan Voß, Sven Spieckermann

Publication date: 16 February 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540310001646821

Mathematics Subject Classification ID

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

Related Items

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs ⋮ A decomposition approach for the car resequencing problem with selectivity banks ⋮ Paint batching problem on \(M\)-to-1 conveyor systems ⋮ Small-world optimization algorithm and its application in a sequencing problem of painted body storage in a car company ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions ⋮ A hybrid particle swarm optimization approach for the sequential ordering problem ⋮ A note on sorting buffers offline ⋮ Reordering buffer management with advice ⋮ Level scheduling under limited resequencing flexibility ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique ⋮ Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops ⋮ Almost Tight Bounds for Reordering Buffer Management

Cites Work

• Online algorithms. The state of the art
• An inexact algorithm for the sequential ordering problem
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
• A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)