Eyeballing heuristics for dynamic lot size problems (Q1118517)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Eyeballing heuristics for dynamic lot size problems |
scientific article; zbMATH DE number 4095171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eyeballing heuristics for dynamic lot size problems |
scientific article; zbMATH DE number 4095171 |
Statements
Eyeballing heuristics for dynamic lot size problems (English)
0 references
1989
0 references
We propose a simple heuristic algorithm for solving the classical discrete dynamic lot size problem without backlogging over a finite planning horizon. It is based on the basic ideas of acceptable inventory sizes to be held over a number of periods. The heuristic can be implemented by only comparing pairs of numbers without any tedious computations. The cost comparisons have shown that its efficiency is very encouraging.
0 references
heuristic algorithm
0 references
discrete dynamic lot size problem without backlogging
0 references
finite planning horizon
0 references
