Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10951-007-0046-4 | J. Scheduling |
Keywords | Field | DocType |
Car sequencing problem,GRASP,Metaheuristics,MILP,Scheduling | Mathematical optimization,GRASP,Scheduling (computing),Computer science,Metaheuristic | Journal |
Volume | Issue | ISSN |
11 | 1 | 1094-6136 |
Citations | PageRank | References |
9 | 0.81 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joaquín Bautista | 1 | 345 | 27.50 |
| Jordi Pereira | 2 | 252 | 19.64 |
| Belarmino Adenso-Díaz | 3 | 143 | 11.44 |