On regenerative processes and inventory control

In this paper we discuss a general framework for single item inventory control models. This framework is based on the regenerative structure of these models. Using results from the theory of regenerative processes a unified presentation of those models is presented. Although most of the results are already known for special cost structures this unified presentation yields us the possibility to show that the same techniques can be applied to each instance

An overview of inventory systems with several demand classes

In this chapter we discuss inventory systems where several demand classes may be distinguished. In particular, we focus on single-location inventory systems and we analyse the use of a so-called critical level policy. With this policy some inventory is reserved for high-priority demand. A number of practical examples where several demand classes naturally arise are presented, and the implications and modelling of the critical level policy in distribution systems are discussed. Finally, an overview of the literature on inventory systems with several demand classes is given

Inventory rationing in an (s, Q) inventory model with lost sales a two demand classes

Whenever demand for a single item can be categorized into classes of different priority, an inventory rationing policy should be considered. In this paper we analyse a continuous review (s,Q) model with lost sales and two demand classes. A so-called critical level policy is applied to ration the inventory among the two demand classes. With this policy, low--priority demand is rejected in anticipation of future high--priority demand whenever the inventory level is at or below a prespecified critical level. For Poisson demand and deterministic lead times, we present an exact formulation of the average inventory cost. A simple optimization procedure is presented, and in a numerical study we compare the optimal rationing policy with a policy where no distinction between the demand classes is made. The benefit of the rationing policy is investigated for various cases and the results show that significant cost reductions can be obtained

The break quantity rule in a 1-warehouse, N-retailers distribution system

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 determines whether an order is small or large. Under the assumptions that the stock at the warehouse can only be used to satisfy large orders, and that demand during the leadtimes is normally distributed, an expression for the inventory costs is derived. The objective of this paper is to provide insight into the effect of the break quantity rule on the inventory holding costs, and therefore we present extensive computational results, showing that in many cases the rule leads to a significant cost reduction

On the marginal cost approach in maintenance

In this paper we investigate the conditions under which the marginal cost approach of Refs. 1-3 holds. As observed in Ref. 4, the validity of the marginal cost approach gives rise to a useful framework of single-component maintenance optimization models, which covers almost all models used in practice. For the class of unimodal finite-valued marginal cost functions, we show that these optimization models are easy to solve

On the newsboy model with a cutoff transaction size

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 transaction size. Moreover, by approximating the distribution of the total demand during a period by the normal distribution one can determine an expression for the average cost function that depends on the cutoff transaction size only. A main advantage of this approximation is that the computational effort is much less. The quality of using the normal approximation is evaluated through a number of numerical experiments, which show that the approximative results are satisfactory

On the use of break quantities in multi--echelon distribution systems

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 different locations. A possible way of dealing with this problem consists of using a so-called break quantity rule. This easy implementable rule is to deliver every order with a size exceeding the break quantity from a higher echelon. The use of the break quantity rule now results in a reduction of the demand variability at the retailer and hence less safety stocks need to be held. The concept is studied for a two-echelon distribution system, consisting of one warehouse and one retailer, where the inventory at the retailer is controlled by an order up to level policy, and where at the warehouse there is enough inventory to satisfy all orders from the retailer and the customers. For this system an approximation for the long run average costs as a function of the break quantity is derived, and an algorithm is presented to determine the cost-optimal break quantity. Computational results indicate that the break quantity rule can lead to significant cost reductions

On Miehle's algorithm and the perturbed lp-distance multifacility location problem

A generalized multifacility location problem in continuous space with distances measured by some Lp-norm is introduced. Using the hyperbolic approximation of the Lp-norm we derive for the perturbed problem a version of Miehle's algorithm and show for 1<=p<=2 that this algorithm converges to the optimal solutio

On the (S-1, S) Lost Sales Inventory Model with Priority Demand Classes

In this paper an inventory model with several demand classes, prioritised according to importance, is analysed. We consider a lot-for-lot or (S-1,S) inventory model with lost sales. For each demand class there is a critical stock level at and below which demand from that class is not satisfied from stock on hand. In this way stock is retained to meet demand from higher priority demand classes. A set of such critical levels determines the stocking policy. For Poisson demand and a generally distributed lead time we derive expressions for the service levels for each demand class and the average total cost per unit time. Efficient solution methods for obtaining optimal policies, with and without service level constraints, are presented. Numerical experiments in which the solution methods are tested demonstrate that significant cost reductions can be achieved by distinguishing between demand classes

An efficient algorithm for a generalized joint replenishment problem

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 algorithm to determine the optimal policy of this type is discussed in this paper. It is shown that this algorithm can be used for deterministic multi-item inventory problems, with general cost rate functions and possibly service level constraints, of which the well-known joint replenishment problem is a special case. Some useful results in determining the optimal control parameters are derived, and worked out for piecewise linear cost rate functions. Numerical results for this case show that the algorithm significantly outperforms other solution methods, both in the quality of the solution as in the running time