A GRASP approach for the extended car sequencing problem

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

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


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.

Original languageEnglish
Pages (from-to)3-16
Number of pages14
JournalJournal of Scheduling
Issue number1
StatePublished - Feb 2008
Externally publishedYes


  • Car sequencing problem
  • MILP
  • Metaheuristics
  • Scheduling


Dive into the research topics of 'A GRASP approach for the extended car sequencing problem'. Together they form a unique fingerprint.

Cite this