A GRASP approach for the extended car sequencing problem

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

Keywords: scheduling, grasp, metaheuristics, MILP, Car sequencing problem

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.

Más información

Título de la Revista: Journal of Scheduling
Volumen: 11
Editorial: Springer
Fecha de publicación: 2008
Página de inicio: 3
Página final: 16
Idioma: English
DOI:

10.1007/s10951-007-0046-4

Notas: WOS Core Collection ISI Scopus