New Bounds for the Joint Replenishment Problem: Tighter, but not always better
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 . We carry out extensive numerical experiments to compare them and to investigate the computational complexity.
|Keywords||bounds, computational complexity, joint replenishment problem|
Porras Musalem, E., & Dekker, R.. (2005). New Bounds for the Joint Replenishment Problem: Tighter, but not always better (No. EI 2005-18). Report / Econometric Institute, Erasmus University Rotterdam. Retrieved from http://hdl.handle.net/1765/6914