Robust car sequencing for automotive assembly
From MaRDI portal
Publication:2030663
DOI10.1016/j.ejor.2020.10.004zbMath1487.90250OpenAlexW3092140417MaRDI QIDQ2030663
Andreas Hottenrott, Leon Waidner, Martin Grunow
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.10.004
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Cites Work
- On the complexity of the car sequencing problem.
- 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
- Soft car sequencing with colors: lower bounds and optimality proofs
- 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
- Analysis and design of sequencing rules for car sequencing
- Sequencing mixed-model assembly lines: survey, classification and model critique
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Constraint satisfaction problems: Algorithms and applications
- Solving real car sequencing problems with ant colony optimization
- Car sequencing versus mixed-model sequencing: a computational study
- Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints
- Review and comparison of three methods for the solution of the car sequencing problem
- Least in-sequence probability heuristic for mixed-volume production lines
