ScholarLens Back to search
1985•International Journal of Operations & Production ManagementRequires access

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

James H. Bookbinder, Jin‐Yan Tan

Open publisher page 15 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Heuristics, Sizing, Heuristic, Computer science, Mathematical optimization, Operations research, Mathematics, Visual arts

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Two Lot‐sizing Heuristics for the Case of Deterministic Time‐varying Demands — Research Paper | ScholarLens