A column generation approach and new bounds for the car sequencing problem

The subject of the 2005 ROADEF challenge was a variation of the car scheduling problem based on the needs of the Renaultfactories. In this paper we revisit this problem to investigate how further contributions can be made in order to close the gap between exact and heuristic methods that exists for...

Full description

Saved in:
Bibliographic Details
Published inAnnals of operations research Vol. 264; no. 1-2; pp. 193 - 211
Main Authors Jahren, Eivind, Achá, Roberto Asín
Format Journal Article
LanguageEnglish
Published New York Springer US 01.05.2018
Springer
Springer Nature B.V
Subjects
Assembly lines
Business and Management
Combinatorics
Heuristic methods
Linear programming
Lower bounds
Management research
Operations research
Operations Research/Decision Theory
Original Paper
Production management
Scheduling (Management)
Sequential scheduling
Theory of Computation
Upper bounds
Integer linear programming
Column generation
Industrial car sequencing
Combinatorial optimization
Online AccessGet full text
ISSN0254-5330
1572-9338
DOI10.1007/s10479-017-2663-4

Cover

More Information
Summary:The subject of the 2005 ROADEF challenge was a variation of the car scheduling problem based on the needs of the Renaultfactories. In this paper we revisit this problem to investigate how further contributions can be made in order to close the gap between exact and heuristic methods that exists for this problem. For the benchmark set used in the final round of the competition we report new lower bounds for 7 out of the 19 instances by using an improved ILP formulation of the problem. We also present a new column generation based exact method for solving the ILP problem which outperforms branch-and-bound in obtaining upper bounds for these problems.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-017-2663-4