The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
From MaRDI portal
Publication:932211
DOI10.1016/j.ejor.2007.04.033zbMath1156.90323MaRDI QIDQ932211
Christian Artigues, Christine Solnon, Van-Dat Cung, Alain Nguyen
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.033
Related Items
CP with ACO, The multi-mode resource-constrained multi-project scheduling problem, The MISTA 2013 challenge, Machine reassignment problem: the ROADEF/EURO challenge 2012, A decomposition approach for the car resequencing problem with selectivity banks, Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions, An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem, Iterated tabu search for the car sequencing problem, A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints, Greedy approach and multi-criteria simulated annealing for the car sequencing problem, Combining two pheromone structures for solving the car sequencing problem with ant colony optimization, Level scheduling for batched JIT supply, Nash game model for optimizing market strategies, configuration of platform products in a vendor managed inventory (VMI) supply chain for a product family, Analysis and design of sequencing rules for car sequencing, Sequencing mixed-model assembly lines to minimize part inventory cost, Sequencing mixed-model assembly lines: survey, classification and model critique, Weight-based heuristics for constraint satisfaction and combinatorial optimization problems, Scheduling just-in-time part supply for mixed-model assembly lines, Iterative beam search for car sequencing, An optimal arc consistency algorithm for a particular case of sequence constraint, Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction, A Lagrangian-ACO matheuristic for car sequencing, Car sequencing versus mixed-model sequencing: a computational study, Optimal production sequencing problem to minimise line stoppage time in a mixed-model assembly line
Uses Software
Cites Work
- On the complexity of the car sequencing problem.
- Algorithms for the car sequencing and the level scheduling problem
- Two local search approaches for solving real-life car sequencing problems
- Iterated tabu search for the car sequencing problem
- Soft car sequencing with colors: lower bounds and optimality proofs
- 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
- Greedy approach and multi-criteria simulated annealing 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
- Constraint satisfaction using constraint logic programming
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Solving real car sequencing problems with ant colony optimization
- Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints
- Compiling constraints in clp(FD)
- Review and comparison of three methods for the solution of the car sequencing problem
- Revisiting the Sequence Constraint
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
