×

A note on the joint replenishment problem under constant demand. (English) Zbl 0778.90007

Summary: This note considers the joint replenishment inventory problem for \(N\) items under constant demand. The frequently-used cyclic strategy \((T;k_ 1,\dots,k_ N)\) is investigated: a family replenishment is made every \(T\) time units and item \(i\) is included in each \(k_ i\)-th replenishment. S. K. Goyal [Manage. Sci. 21, 436-443 (1974)] proposed a solution to find the global optimum within the class of cyclic strategies. However, we will show that the algorithm of Goyal does not always lead to the optimal cyclic strategy. A simple correction is suggested.

MSC:

90B05 Inventory, storage, reservoirs
PDFBibTeX XMLCite
Full Text: DOI