The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds (Q3348674)
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 4199930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds |
scientific article; zbMATH DE number 4199930 |
Statements
The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds (English)
0 references
1990
0 references
joint replenishment
0 references
lot sizing
0 references
nonstationary demand
0 references
discrete time
0 references
NP- complete
0 references
worst case performance
0 references
multipass heuristic
0 references
0.8534426093101501
0 references
0.8515676856040955
0 references
0.8496109843254089
0 references
0.8446110486984253
0 references
