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

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.

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

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

We consider a joint manufacturing / remanufacturing environment with remanufacturing yield loss. Demand and return follow independent stationary Poisson processes. Returns can be disposed off upon arrival to the system. Manufacturing and remanufacturing operations performed in the same facility...

We address the dynamic lot sizing problem for systems with product returns. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied by manufactured/procured new items, but also by remanufactured returned items. The objective is to determine...

In this article, we investigate the profitability of remanufacturing option when the manufactured and remanufactured products are segmented to different markets and the production capacity is finite. It is assumed that remanufactured products can be substituted by the manufactured ones. A single...

In most multi-item inventory systems, the ordering costs consist of a major cost and a minor cost for each item included. Applying for every individual item a cyclic inventory policy, where the cycle length is a multiple of some basic cycle time, reduces the major ordering costs. An efficient...

In this paper we discuss a general framework for single component replacement models. This framework is based on the regenerative structure of these models and by using results from renewal theory a unified presentation of the discounted and average finite and infinite horizon cost models is...