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

Full description

Saved in:

Bibliographic Details
Published in:	Operations research Vol. 55; no. 5; pp. 909 - 920
Main Authors:	Degraeve, Zeger, Jans, Raf
Format:	Journal Article
Language:	English
Published:	Linthicum, MD INFORMS 01.09.2007 Institute for Operations Research and the Management Sciences
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!