A Sequential Lot Sizing Heuristic with Optimal Average Performance

Sven Axsäter
Additional contact information
Sven Axsäter: Luleå University of Technology, S-951 87 Luleå, Sweden

Management Science, 1988, vol. 34, issue 11, 1324-1332

Abstract: The classical dynamic lot size problem without backlogging is in practice usually solved with the aid of various heuristics. Most heuristics are sequential techniques, i.e. the future demand is considered period for period, and a decision whether to have a set-up or not in a certain period is taken without regarding the future demand. The average performance of a lot sizing heuristic will depend on the demand process. We assume that a typical demand will look like a sequence of independent identically distributed random numbers, and we derive a sequential lot sizing rule with optimal average performance under such circumstances. The optimal decision rule is compared to the Silver-Meal heuristic. We also analyze the situation when the decision rule is allowed to look ahead one period.

Keywords: deterministic production planning; lot sizing; production planning (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.34.11.1324 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:34:y:1988:i:11:p:1324-1332

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().