Heuristic Methods for the Multi-product Dynamic Lot Size Problem
作者:
IyogunPaul,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1991)
卷期:
Volume 42,
issue 10
页码: 889-894
ISSN:0160-5682
年代: 1991
DOI:10.1057/jors.1991.169
出版商: Taylor&Francis
关键词: production;inventory;lot-size problem;joint replenishment problem
数据来源: Taylor
摘要:
AbstractMany heuristics exist for the single-item dynamic lot-size problem, for example, the Silver-Meal, the part period balancing and a simple variant of the part period balancing. The worst case performances of these heuristics have been shown to be zero, 1/3 and 1/2 respectively. These heuristics can be generalized to the dynamic version of the joint replenishment problem, that is, the multi-product dynamic lot-size problem. Such a generalization of the Silver-Meal heuristic has been shown to perform well on a set of test problems. This paper generalizes the part period balancing heuristic, and a simple variant of it to the multiproduct dynamic lot-size problem, and shows that the worst case performances of the generalized heuristics remain 1/3 and 1/2 respectively. An improved version of the generalized Silver-Meal heuristic is also given.
点击下载:
PDF (2803KB)
返 回