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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 237; H. 2; S. 498 - 507
Hauptverfasser:	Gicquel, C., Lisser, A., Minoux, M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.09.2014 Elsevier Sequoia S.A Elsevier
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!