Heuristic Methods for the Multi-product Dynamic Lot Size Problem (Q3983499)
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 26857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic Methods for the Multi-product Dynamic Lot Size Problem |
scientific article; zbMATH DE number 26857 |
Statements
Heuristic Methods for the Multi-product Dynamic Lot Size Problem (English)
0 references
27 June 1992
0 references
joint replenishment problem
0 references
multi-product dynamic lot-size
0 references
Silver-Meal heuristic
0 references
part balancing heuristic
0 references
worst case performances
0 references
0.9723062
0 references
0.9500011
0 references
0.9472364
0 references
0.9410428
0 references
0.91906786
0 references
0.91881424
0 references
0.9164823
0 references
0.91604006
0 references
