A Sequential Lot Sizing Heuristic with Optimal Average Performance (Q3812002)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4081258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Sequential Lot Sizing Heuristic with Optimal Average Performance |
scientific article; zbMATH DE number 4081258 |
Statements
A Sequential Lot Sizing Heuristic with Optimal Average Performance (English)
0 references
1988
0 references
production planning
0 references
dynamic lot size
0 references
without backlogging
0 references
heuristics
0 references
sequence lot sizing rule
0 references
optimal average performance
0 references
0.8346848487854004
0 references
0.8270625472068787
0 references
0.8262855410575867
0 references
0.8260592818260193
0 references
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 sequence lot sizing rule with optimal average performance under such circumstances. The optimal decision rule is compared to the heuristic of \textit{E. A. Silver} and \textit{H. C. Meal} [Production Inventory Manage. 14, No.2, 64-77 (1973)]. We also analyze the situation when the decision rule is allowed to look ahead one period.
0 references