On the complexity of the car sequencing problem.
From MaRDI portal
Publication:703239
DOI10.1016/j.orl.2003.09.003zbMath1054.90034OpenAlexW1965198992MaRDI QIDQ703239
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.09.003
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
A GRASP approach for the extended car sequencing problem ⋮ A decomposition approach for the car resequencing problem with selectivity banks ⋮ Algorithms for the car sequencing and the level scheduling problem ⋮ Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem ⋮ Large neighborhood improvements for solving car sequencing problems ⋮ Improvement of earliness and lateness by postponement on an automotive production line ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Two local search approaches for solving real-life car sequencing problems ⋮ Iterated tabu search for the car sequencing problem ⋮ An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem ⋮ Solving the car sequencing problem via branch \& bound ⋮ Combining two pheromone structures for solving the car sequencing problem with ant colony optimization ⋮ Advanced constraint propagation for the combined car sequencing and level scheduling problem ⋮ Solving real car sequencing problems with ant colony optimization ⋮ Robust car sequencing for automotive assembly ⋮ A Lagrangian-ACO matheuristic for car sequencing ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique ⋮ Considering Distribution Logistics in Production Sequencing: Problem Definition and Solution Algorithm ⋮ Iterative beam search for car sequencing
Cites Work
