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

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

In this paper we analyse the effect of satisfying in a different way customers with an order larger than a prespecified cutoff transaction size, in a simple newsboy setting. For compound Poisson demand with discrete order sizes, we show how to determine the expected costs and the optimal cutoff...

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

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 multi-echelon distribution systems it is usually assumed that demand is only satisfied from the lowest echelon. In this paper we will consider the case where demand can be satisfied from any level in the system. However, then the problem arises of how to allocate orders from customers to the...

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