Two Lot‐sizing Heuristics for the Case of Deterministic Time‐varying Demands
- 1 April 1985
- journal article
- Published by Emerald Publishing in International Journal of Operations & Production Management
- Vol. 5 (4) , 30-42
- https://doi.org/10.1108/eb054746
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.Keywords
This publication has 7 references indexed in Scilit:
- Lot sizing algorithms with applications to engineering and economicsInternational Journal of Production Research, 1984
- A re-examination of lot sizing procedures for requirements planning systems: some modified rulesInternational Journal of Production Research, 1983
- The Ubiquitous EOQ — Its Relation to Discrete Lot Sizing HeuristicsInternational Journal of Operations & Production Management, 1981
- HEURISTIC LOT‐SIZING PERFORMANCE IN A ROLLING‐SCHEDULE ENVIRONMENT*Decision Sciences, 1980
- AN EXPERIMENTAL STUDY OF THE EFFECTIVENESS OF ROLLING SCHEDULES IN PRODUCTION PLANNINGDecision Sciences, 1977
- An economic lot-sizing technique, I: The part-period algorithmIBM Systems Journal, 1968
- Dynamic Version of the Economic Lot Size ModelManagement Science, 1958