Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem: A Heuristic Implementation
作者:
J.M. Thizy,
L.N. Van Wassenhove,
期刊:
IIE Transactions
(Taylor Available online 1985)
卷期:
Volume 17,
issue 4
页码: 308-313
ISSN:0740-817X
年代: 1985
DOI:10.1080/07408178508975308
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
The multi-item capacitated lot-sizing problem consists of determining the magnitude and the timing of some operations of durable results for several items in a finite number of processing periods so as to satisfy a known demand in each period. The subgradient algorithm implemented to minimize the processing costs is based on a Lagrangean relaxation of the capacity constraints imposed on the resources. The method incorporates a primal partitioning scheme—with a network flow subproblem—to obtain good feasible solutions.
点击下载:
PDF (297KB)
返 回