Soft car sequencing with colors: lower bounds and optimality proofs

DOI10.1016/J.EJOR.2007.04.035MaRDI QIDQ932214zbMATH OpenOpenAlexFDO

Authors Thierry Benoist

Publication date 10 July 2008

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2007.04.035

zbMATH Keywords

car sequencingdynamic programminglinear programminglocal search

Mathematics Subject Classification ID

Search theory (90B40) Linear programming (90C05) Dynamic programming (90C39)

Recommendations

• Local search and suffix tree for car-sequencing problem with colors
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Review and comparison of three methods for the solution of the car sequencing problem
• A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
• Solving the car sequencing problem via branch \& bound

Cites work

• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
• Cyclic Scheduling via Integer Programs with Circular Ones
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Fundamentals of scatter search and path relinking
• Future paths for integer programming and links to artificial intelligence
• scientific article; zbMATH DE number 2079896 (Why is no real title available?)
• Review and comparison of three methods for the solution of the car sequencing problem
• Upper bounds for revenue maximization in a satellite scheduling problem

Cited in

(13)

• A column generation approach and new bounds for the car sequencing problem
• Advanced constraint propagation for the combined car sequencing and level scheduling problem
• Robust car sequencing for automotive assembly
• Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
• Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
• Iterative beam search for car sequencing
• Car sequencing versus mixed-model sequencing: a computational study
• Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
• On the complexity of the car sequencing problem.
• A GRASP approach for the extended car sequencing problem
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Local search and suffix tree for car-sequencing problem with colors
• A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints

Describes a project that uses

Uses Software

• Scatter Search

This page was built for publication: Soft car sequencing with colors: lower bounds and optimality proofs

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