Worst case performance for lot sizing heuristics (Q1160558)
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 3750650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst case performance for lot sizing heuristics |
scientific article; zbMATH DE number 3750650 |
Statements
Worst case performance for lot sizing heuristics (English)
0 references
1982
0 references
dynamic lot size problem
0 references
worst case performance
0 references
Silver-Meal algorithm
0 references
no backlogging
0 references
heuristic algorithm
0 references
comparison of algorithms
0 references
