Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem
Journal of Automated Reasoning
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
Solving Car Sequencing Problems by Local Optimization
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Applications of Constraint Programming
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
INFORMS Journal on Computing
Constraint-Based Local Search
Tackling car sequencing problems using a generic genetic algorithm
Evolutionary Computation
A study of greedy, local search, and ant colony optimization approaches for car sequencing problems
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
On the complexity of the car sequencing problem
Operations Research Letters
| Hi-index | 0.00 |
This paper presents a solution procedure for a new variant of the Car Sequencing Problem (CSP) based on the GRASP metaheuristic. In this variant, called xCSP (extended CSP), the aim is to satisfy the hard constraints of the CSP while scheduling the maximum possible number of cars with specific options at specific times of the day in order to satisfy other production requirements. Additional constraint ratios are likewise considered that force at least a minimum specific number of consecutive options. An extension of the CSP is formalized in this paper and computational results are presented using available on-line instances that verify the good performance of a GRASP procedure defined for the xCSP.