Two Lot‐sizing Heuristics for the Case of Deterministic Time‐varying Demands

Two lot‐sizing heuristics are proposed for deterministic time‐varying demands, a case commonly encountered in requirements planning systems. The first heuristic simplifies the stopping rule of the Silver‐Meal (SM) heuristic so that difficult cases may be solved nearly optimally. The second combines the merits of both the SM and the Least‐Unit‐Cost heuristic Both perform favourably even when compared to recent modifications to the basic SM algorithm.

MoreLess

Year of publication:	1985
Authors:	Bookbinder, James H. ; Tan, Jin‐Yan
Published in:	International Journal of Operations & Production Management. - MCB UP Ltd, ISSN 1758-6593, ZDB-ID 2032083-8. - Vol. 5.1985, 4, p. 30-42
Publisher:	MCB UP Ltd
Subject:	Heuristic Methods \| Production Planning

More details

Type of publication:	Article
Type of publication (narrower categories):	review-article
Language:	English
Other identifiers:	10.1108/eb054746 [DOI]
Source:	Other ZBW resources

Persistent link: https://www.econbiz.de/10014791012