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 [7]. We carry out extensive numerical experiments to compare them and to investigate the computational complexity.

MoreLess

Year of publication:	2005-07-31
Authors:	Dekker, Rommert ; Porras Musalem, Porras Musalem, E.
Institutions:	Faculteit der Economische Wetenschappen, Erasmus Universiteit Rotterdam
Subject:	bounds \| computational complexity \| joint replenishment problem

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Econometric Institute Research Papers. - ISSN 1566-7294.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series RePEc:ems:eureir Number EI 2005-18
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010837982