A heuristic for multi-level lot-sizing problems with a bottleneck
作者:
B. Toklu,
J. M. Wilson,
期刊:
International Journal of Production Research
(Taylor Available online 1992)
卷期:
Volume 30,
issue 4
页码: 787-798
ISSN:0020-7543
年代: 1992
DOI:10.1080/00207543.1992.9728456
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
A simple heuristic is proposed for multi-level lot-sizing problems where there is a bottleneck. Previous methods to solve this problem have formulated the problem as an integer programming problem and solved the problem using a Lagrangian relaxation embedded within the branch and bound procedure. In this paper we suggest that items to be produced can be grouped into two types and a simple but efficient heuristic can be used to determine the production quantities required. A program was developed to compute production levels and was found to require only a small fraction of the computer time required by the full integer programming approach, and to produce solutions of reasonable quality. The heuristic is simple to implement.
点击下载:
PDF (581KB)
返 回