A sequential ordering problem in automotive paint shops

DOI10.1080/00207540310001646821zbMATH Open1094.90018OpenAlexW2142215646MaRDI QIDQ3159669FDOQ3159669

Authors: Sven Spieckermann, Kai Gutenschwager, Stefan Voß 

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

Recommendations

• Paint batching problem on \(M\)-to-1 conveyor systems
• Sorting with line storage systems
• Sequencing jobs on an automobile assembly line: objectives and procedures
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Solving real car sequencing problems with ant colony optimization

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

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

This page was built for publication: A sequential ordering problem in automotive paint shops

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