Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
作者:
HindiK. S.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1995)
卷期:
Volume 46,
issue 4
页码: 465-472
ISSN:0160-5682
年代: 1995
DOI:10.1057/jors.1995.65
出版商: Taylor&Francis
关键词: production planning;capacitated lot-sizing;network flows
数据来源: Taylor
摘要:
AbstractThe multi-item lot-sizing problem considered here is concerned with finding the lot sizes over a horizon of discrete time periods to meet known future demand without incurring backlogs, such that the total cost of production and inventory holding is minimized. The capacity constraints arise because the production of each item consumes capacitated production resources at a given rate. Production is assumed to occur without set-ups. The problem is formulated as a capacitated trans-shipment problem. Use of modern, minimum-cost network flow algorithms, coupled with appropriate starting procedures, allows realistically large problem instances to be solved efficiently; thus obviating the need for specialized algorithms based on restrictive assumptions regarding cost structures.
点击下载:
PDF (3055KB)
返 回