Iterative beam search for car sequencing
From MaRDI portal
Publication:2341215
DOI10.1007/s10479-014-1733-0zbMath1309.90086OpenAlexW2120026098WikidataQ58205396 ScholiaQ58205396MaRDI QIDQ2341215
Uli Golle, Nils Boysen, Franz Rothlauf
Publication date: 23 April 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1733-0
Related Items (3)
A decomposition approach for the car resequencing problem with selectivity banks ⋮ Advanced constraint propagation for the combined car sequencing and level scheduling problem ⋮ Car sequencing versus mixed-model sequencing: a computational study
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Soft car sequencing with colors: lower bounds and optimality proofs
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Solving the car sequencing problem via branch \& bound
- A beam search approach for the optimization version of the car sequencing problem
- Sequencing mixed-model assembly lines: survey, classification and model critique
- Scattered branch and bound. An adaptive search strategy applied to resource-constrained project scheduling
- Solving real car sequencing problems with ant colony optimization
- Review and comparison of three methods for the solution of the car sequencing problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem
This page was built for publication: Iterative beam search for car sequencing
