A Stepwise partial enumeration algorithm for the economic lot scheduling problem
作者:
KyungS. Park,
DeokK. Yun,
期刊:
IIE Transactions
(Taylor Available online 1984)
卷期:
Volume 16,
issue 4
页码: 363-370
ISSN:0740-817X
年代: 1984
DOI:10.1080/07408178408975256
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
This paper presents a stepwise partial enumeration algorithm for determining the economic lot schedule of a multiproduct single facility system on a repetitive basis. The algorithm is based on a simple “sufficient feasibility” test. The algorithm starts from a feasible schedule determined from the common cycle solution and continues stepwise partial enumerations to improve the schedule until no appreciable improvement occurs. Performance of the algorithm is demonstrated by solving six problems recently solved by Haessler. The algorithm gives better or equal solutions to the problems.
点击下载:
PDF (460KB)
返 回