An evaluation of semidefinite programming based approaches for discrete lot-sizing problems

•We study a lot-sizing problem with sequence-dependent changeover costs and times.•This problem is formulated as a quadratically constrained quadratic binary program.•We compute lower bounds using a semidefinite rather than a linear relaxation.•Comparison with the best known linear relaxations shows...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 237; číslo 2; s. 498 - 507
Hlavní autori: Gicquel, C., Lisser, A., Minoux, M.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 01.09.2014
Elsevier Sequoia S.A
Elsevier
Predmet:
Comparative analysis
Competitive advantage
Computation
Computer programs
Computer Science
Cutting planes
Discrete lot-sizing and scheduling problem
Integer programming
Lower bounds
Manufacturing
Mathematical models
Mathematical problems
Mathematical programming
Operational research
Operations Research
Optimization
Quadratic programming
Quadratically constrained quadratic binary programming
Semidefinite programming
Semidefinite relaxation
Sequence-dependent changeover costs and times
Solution strengthening
Studies
Quadratically constrained quadratic binary programming
Discrete lot-sizing and scheduling problem
Semidefinite relaxation
Manufacturing
Cutting planes
Sequence-dependent changeover costs and times
semidefinite relaxation
manufacturing
quadratically constrained quadratic binary programming
cutting planes
discrete lot-sizing and scheduling problem
sequence-dependent changeover costs and times
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•We study a lot-sizing problem with sequence-dependent changeover costs and times.•This problem is formulated as a quadratically constrained quadratic binary program.•We compute lower bounds using a semidefinite rather than a linear relaxation.•Comparison with the best known linear relaxations shows a significant improvement.•The SDP relaxation provides the optimal integer value for 83% of the small-size instances. The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including sequence-dependent changeover costs and times. Such problems can be formulated as quadratically constrained quadratic binary programs. We investigate several semidefinite relaxations by combining known reformulation techniques recently proposed for generic quadratic binary problems with problem-specific strengthening procedures developed for lot-sizing problems. Our computational results show that the semidefinite relaxations consistently provide lower bounds of significantly improved quality as compared with those provided by the best previously published linear relaxations. In particular, the gap between the semidefinite relaxation and the optimal integer solution value can be closed for a significant proportion of the small-size instances, thus avoiding to resort to a tree search procedure. The reported computation times are significant. However improvements in SDP technology can still be expected in the future, making SDP based approaches to discrete lot-sizing more competitive.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2014.02.027