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

Abstract

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.

Citation

Bookbinder, J.H. and Tan, J. (1985), "Two Lot‐sizing Heuristics for the Case of Deterministic Time‐varying Demands", International Journal of Operations & Production Management, Vol. 5 No. 4, pp. 30-42. https://doi.org/10.1108/eb054746