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

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

The present paper discusses an approach to solve the joint replenishment problem in a production environment with concave production cost functions. Under this environment, the model leads to a global optimization problem, which is investigated by using some standard results from convex...

This paper examines the algorithms proposed in the literature for finding good critical level policies in the (S-1,S) lost sales inventory model with multiple demand classes. Our main result is that we establish guaranteed optimality for two of these algorithms. This result is extended to...

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 the effect of the break quantity rule on the inventory costs in a 1-warehouse, N-retailers distribution system is analyzed. The break quantity rule is to deliver large orders from the warehouse, and small orders from the nearest retailer, where a so--called break quantity...

In this chapter we discuss a tactical optimisation problem that arises in a multistage distribution system where customer orders can be delivered from any stockpoint. A simple rule to allocate orders to locations is a break quantity rule, which routes large orders to higher-stage stockpoints and...

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