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

James H. Bookbinder · Jin‐Yan Tan

15 citations0/0 files storedInternational Journal of Operations & Production Management

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Supply Chain and Inventory Management Management and Optimization Techniques Scheduling and Optimization Algorithms

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 15 citations exist upstream.

References

1958Dynamic Version of the Economic Lot Size Model 1983Production and inventory management 1980HEURISTIC LOT‐SIZING PERFORMANCE IN A ROLLING‐SCHEDULE ENVIRONMENT*1968An economic lot-sizing technique, I: The part-period algorithm 1984Two Modifications Of The Silver-Meal Lot Sizing Heuristic 1981The Ubiquitous EOQ — Its Relation to Discrete Lot Sizing Heuristics

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.