Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”

Abstract

The Dynamic Programming algorithm proposed by Rosenblatt and Kaspi (Rosenblatt, M. J., M. Kaspi. 1985. A dynamic programming algorithm for joint replenishment under general order cost functions. Management Sci. 31 (March) 369–373.) for an optimum partition problem is shown to be incorrect. An alternative Dynamic Programming algorithm is presented for this problem.