Soft car sequencing with colors: lower bounds and optimality proofs

DOI10.1016/J.EJOR.2007.04.035zbMath1156.90373OpenAlexW2056056035MaRDI QIDQ932214

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

linear programmingdynamic programminglocal searchcar sequencing

Mathematics Subject Classification ID

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

Related Items (7)

A column generation approach and new bounds for the car sequencing problem ⋮ Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Robust car sequencing for automotive assembly ⋮ Car sequencing versus mixed-model sequencing: a computational study ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ Iterative beam search for car sequencing

Uses Software

• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
• Upper bounds for revenue maximization in a satellite scheduling problem
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Future paths for integer programming and links to artificial intelligence
• Review and comparison of three methods for the solution of the car sequencing problem
• Cyclic Scheduling via Integer Programs with Circular Ones

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