A beam search approach for the optimization version of the car sequencing problem

DOI10.1007/s10479-007-0278-xzbMath1151.90380OpenAlexW2070033975MaRDI QIDQ940889

Belarmino Adenso-Díaz, Joaquín Bautista, Jordi Pereira

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0278-x

zbMATH Keywords

schedulingbeam searchcar sequencing problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

A GRASP approach for the extended car sequencing problem ⋮ Models for MMSP-W considering workstation dependencies: a case study of Nissan's Barcelona plant ⋮ Advanced constraint propagation for the combined car sequencing and level scheduling problem ⋮ A Lagrangian-ACO matheuristic for car sequencing ⋮ Iterative beam search for car sequencing

Uses Software

• Beam-ACO

Cites Work

• Unnamed Item
• Algorithms for the car sequencing and the level scheduling problem
• Constraint satisfaction using constraint logic programming
• Heuristics and exact algorithms for solving the Monden problem
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• Solving real car sequencing problems with ant colony optimization
• Review and comparison of three methods for the solution of the car sequencing problem

This page was built for publication: A beam search approach for the optimization version of the car sequencing problem