During the last two decades, many heuristic procedures for the joint replenishment problem have appeared in the literature. The only available optimal solution procedure was based on an enumerative approach and was computationally prohibitive. In this paper we present an alternative optimal...

In this paper we give a complete analysis of the joint replenishment problem (JRP) under constant demands and continuous time. We present a solution method for the JRP when a correction is made for empty replenishments, and we test the solution procedures with real data. We show that the...

This article studies specific aspects of the joint replenishment problem in a real supply chain setting. Particularly we analyze the effect on inventory performance of having minimum order quantities for the different products in the joint order, given a complex transportation cost structure....

In this paper we proposed an efficient algorithm to solve the joint replenishment problem to optimality. We perform a computational study to compare the performance of the proposed algorithm with the best one reported in Viswanathan [6]. The study reveals that for large minor set-up costs and...

We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We first study an iterative procedure that proves to be not efficient in this case. Further, we derive bounds on the basic...