A practical stochastic location-inventory-delivery problem with multi-item joint replenishment is studied. Unlike the conventional location-inventory model with a continuous-review (r, Q) inventory policy, the periodic-review inventory policy is adopted with multi-item joint replenishment under...

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...

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 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...

In this paper, we propose a new differential evolution (DE) algorithm for joint replenishment of inventory using both direct grouping and indirect grouping which allows for the interdependence of minor ordering costs. Since solutions to the joint replenishment problem (JRP) can be represented by...

Joint replenishment for several products to achieve a lower inventory logistics cost has been a topic of extensive studies. Less attention has been paid to the issue of deciding how the joint replenishment costs should be allocated across the individual products. Ideally, when items are ordered...

This note deals with the joint replenishment problem with stochastic demands. A new class of policies called P(s, S) policy is proposed for this problem. The proposed policy uses independent, periodic review (s, S) policies for each item. Results on test problems show that the proposed policy is...

We consider jointly replenishing n ex-ante identical firms that operate under an EOQ like setting using a non-cooperative game under asymmetric information. In this game, each firm, upon being privately informed about its demand rate (or inventory cost rate), submits a private contribution to an...

We study a non-cooperative game for joint replenishment by n firms that operate under an EOQ-like setting. Each firm decides whether to replenish independently or to participate in joint replenishment, and how much to contribute to joint ordering costs in case of participation. Joint...

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...