A GRASP approach for the extended car sequencing problem

DOI10.1007/s10951-007-0046-4zbMath1168.90422OpenAlexW2036118165MaRDI QIDQ835577

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

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-007-0046-4

zbMATH Keywords

schedulingmetaheuristicsGRASPMILPcar sequencing problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Models for MMSP-W considering workstation dependencies: a case study of Nissan's Barcelona plant ⋮ Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules ⋮ Advanced constraint propagation for the combined car sequencing and level scheduling problem

Uses Software

• COMET
• CSPLib

Cites Work

• On the complexity of the car sequencing problem.
• A beam search approach for the optimization version of the car sequencing problem
• Sequencing mixed-model assembly lines: survey, classification and model critique
• A probabilistic heuristic for a computationally difficult set covering problem
• Constraint satisfaction using constraint logic programming
• Balancing assembly lines effectively -- a computational comparison
• Parallel Local Search in Comet
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A GRASP approach for the extended car sequencing problem