A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times

Although the textbook Dantzig-Wolfe decomposition reformulation for the capacitated lot-sizing problem, as already proposed by Manne [Manne, A. S. 1958. Programming of economic lot sizes. Management Sci. 4 (2) 115–135], provides a strong lower bound, it also has an important structural deficiency. I...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operations research Jg. 55; H. 5; S. 909 - 920
Hauptverfasser:	Degraeve, Zeger, Jans, Raf
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Linthicum, MD INFORMS 01.09.2007 Institute for Operations Research and the Management Sciences
Schlagworte:	Algorithms Analysis Applied sciences branch-and-price Capital costs column generation Datasets decomposition Decomposition method Exact sciences and technology Heuristic Heuristics Integer programming Integers Integrality Inventory control, production control. Distribution inventory/production: lot sizing Lagrange multiplier Mathematical programming Operational research and scientific management Operational research. Management science Optimization algorithms Production costs Production planning Production quantity Scheduling setup times Studies Total costs United States Polytope Branching Lower bound Subgradient optimization Mixed integer programming Lot sizing Economic sciences Modeling Integer programming Column generation algorithms: decomposition branch-and-price; inventory/production; lot sizing: setup times Setup time Inventory control
ISSN:	0030-364X, 1526-5463
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!