New Bounds for the Joint Replenishment Problem: Tighter, but not always better
2005-07-31
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ei2005-18.pdf, 0.3MB) |
In this paper we present new bounds on the basic cycle time for optimal methods to solve the JRP. They are tighter than the ones reported in Viswanathan [7]. We carry out extensive numerical experiments to compare them and to investigate the computational complexity.
Keywords
Automatically Extracted Terms
- bound
- algorithm
- number
- porras-wild
- wildeman
- wildeman bounds
- viswanathan
- value
- problem
- replenishment problem
- procedure
- cpu time
- complexity
- interval
- increase
- viswanathan bounds
- porras-wv
- iterative procedure
- 0.0087
- 0.0082
