Multi-item spare parts systems with lateral transshipments and waiting time constraints

This paper deals with the analysis of a multi-item, continuous review model of two-location inventory systems for repairable spare parts, used for expensive technical systems with high target availability levels. Lateral and emergency shipments occur in response to stockouts. A continuous review basestock policy is assumed for the inventory control of the spare parts. The objective is to minimize the total costs for inventory holding, lateral transshipments and emergency shipments subject to a target level for the average waiting time per demanded part at each of the two locations. A solution procedure based on Lagrangian relaxation is developed to obtain both a lower bound and an upper bound on the optimal total cost. The upper bound follows from a heuristic solution. An extensive numerical experiment shows an average gap of only 0.31% between the lower and upper bounds. The experiment also gives insights into the relative improvement achieved by applying lateral transshipments and or the system approach. We also apply the proposed model to actual data from an air carrier company.     

Service differentiation through selective lateral transshipments

We consider a multi-item spare parts problem with multiple warehouses and two customer classes, where lateral transshipments are used as a differentiation tool. Specifically, premium requests that cannot be met from stock at their preferred warehouse may be satisfied from stock at other warehouses (so-called lateral transshipments). We first derive approximations for the mean waiting time per class in a single-item model with selective lateral transshipments. Next, we embed our method in a multi-item model minimizing the holding costs and costs of lateral and emergency shipments from upstream locations in the network. Compared to the option of using only selective emergency shipments for differentiation, the addition of selective lateral transshipments can lead to significant further cost savings (14% on average).     

Inventory models with lateral transshipments: A review

Lateral transshipments within an inventory system are stock movements between locations of the same echelon. These transshipments can be conducted periodically at predetermined points in time to proactively redistribute stock, or they can be used reactively as a method of meeting demand which cannot be satisfied from stock on hand. The elements of an inventory system considered, e.g. size, cost structures and service level definition, all influence the best method of transshipping. Models of many different systems have been considered. This paper provides a literature review which categorizes the research to date on lateral transshipments, so that these differences can be understood and gaps within the literature can be identified.     

Trade-off between capacity invested and inventory needed

A multi-item capacitated make-to-order production system with considerable demand fluctuations is discussed. The relationship between the available capacity and the inventory needed to meet customer requirements with a pre-defined service level is modeled. Furthermore, the total cost for both capacity and inventory is minimized and it is shown that, assuming negligible change-over times, the double of the surplus inventory cost has to be equal to the excess capacity cost to ensure minimum total cost.     

Multi-location transshipment problem with capacitated transportation

We consider coordination among stocking locations through replenishment strategies that take explicitly into consideration transshipments, transfer of a product among locations at the same echelon level. We incorporate transportation capacity such that transshipment quantities between stocking locations are bounded due to transportation media or the location’s transshipment policy. We model different cases of transshipment capacity as a capacitated network flow problem embedded in a stochastic optimization problem. Under the assumption of instantaneous transshipments, we develop a solution procedure based on infinitesimal perturbation analysis to solve the stochastic optimization problem, where the objective is to find the policy that minimizes the expected total cost of inventory, shortage, and transshipments. Such a numerical approach provides the flexibility to solve complex problems. Investigating two problem settings, we show the impact of transshipment capacity between stocking locations on system behavior. We observe that transportation capacity constraints not only increase total cost, they also modify the inventory distribution throughout the network.     

Towards a normative model for inventory cost management in a generalized ABC classification system

This paper establishes a general ABC inventory classification system as the foundation for a normative model of the maintenance cost structure and stock turnover characteristics of a large, multi-item inventory system with constant demand. For any specified number of inventory classes, the model allows expression of the overall system combined ordering and holding cost in terms of (i) the re-ordering frequencies for the items in each inventory class and (ii) the inventory class structure, that is, the proportion of the total system's items that are in each inventory class. The model yields a minimum total maintenance cost function, which reflects the effect of class structure on inventory maintenance costs and turnover. If the Pareto curve (a.k.a. Distribution-by-value function) for the inventory system can be expressed (or approximated) analytically, the model can also be used to determine an optimal class structure, as well as an appropriate number of inventory classes. A special case of the model produces a simply structured, class-based ordering policy for minimizing total inventory maintenance costs. Using real data, the cost characteristics of this policy are compared to those of a heuristic, commonly used by managers of multi-item inventory systems. This cost comparison, expressed graphically, underscores the need for normative modelling approaches to the problem of inventory cost management in large, multi-item systems.     

Stock redistribution in two-echelon logistics systems

Consider a two-echelon periodic-review network consisting of a warehouse W and retailers R₁,…,R _n . Between replenishments of the overall system, stocks at certain retailers may become unbalanced. Therefore we allow, at a cost, the possibility of a lateral supply between retailers. This constitutes a ‘redistribution’, horizontal shipments made one period before the next regular replenishment opportunity. A stochastic inventory model is presented for such a system whose multiple stock-keeping locations have nonidentical costs; this is a major difference between the research reported here and previous work on redistribution. We developed an algorithm for carrying out the redistribution, and prove that the result is near optimal. A combination of analytical and simulation results quantify the benefits (lower costs and decreased safety stock) to our redistribution model. The resulting cost and service are compared to those of the simple allocation model (no lateral transshipments). Our cost-minimisation model is also compared to the complete redistribution model of Jonsson and Silver,¹ who minimised backorders.     

Heuristics for assessing emergency transshipments

It is not uncommon for organizations with multiple stock-keeping facilities to have some locations facing shortages while others have excess inventory. This paper examines emergency transshipments of product as an approach to solve this problem. Specifically, two heuristics are developed to assist managers in determining when stock transfers should be made. The heuristics produce critical values for on-hand inventory levels above which transshipments minimize overall expected costs. They also provide insight into the factors affecting transshipment usage.     

An inventory model with unidirectional lateral transshipments

This paper deals with a continuous review inventory system with Poisson demand, in which lateral transshipments are allowed. In case of a shortage at a location, another location acts as a supplier, if it is possible. A common assumption in earlier papers is that transshipments are allowed between all locations. This network configuration may, however, not be the best choice for many reasons. One such reason is that it may be difficult to establish contracts between locations regarding the design of the transshipment policy. Another reason is that a system with many transshipment links is much more complex than a system with few transshipment links. In this paper, we study a system where transshipments are allowed only in one direction. This may be a reasonable policy if the locations have very different backorder/lost sales costs. Our approach is relatively simple and fast, and works well in most cases.     

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 and in the running time.     

A multi-product continuous review inventory system with stochastic demand,backorders, and a budget constraint

Common characteristics of inventory systems include uncertain demand and restrictions such as budgetary or storage space constraints. Several authors have examined budget constrained multi-item stochastic inventory systems controlled by continuous review policies without considering marginal shortage costs. Existing models assume that purchasing costs are paid at the time an order is placed, which is not always the case since in some systems purchasing costs are paid when orders arrive. In the latter case the maximum investment in inventory is random since the inventory level when an order arrives is a random variable. Hence payment of purchasing costs on delivery yields a stochastic budget constraint for inventory. This paper models a multi-item stochastic inventory system with backordered shortages when estimation of marginal backorder cost is available, and payment is due upon order arrival. The budget constraint can easily be converted into a storage constraint.     

A simulation optimization approach for a two-echelon inventory system with service level constraints

In this paper, we present a simulation optimization algorithm for solving the two-echelon constrained inventory problem. The goal is to determine the optimal setting of stocking levels to minimize the total inventory investment costs while satisfying the expected response time targets for each field depot. The proposed algorithm is more adaptive than ordinary optimization algorithms, and can be applied to any multi-item multi-echelon inventory system, where the cost structure and service level function resemble what we assume. Empirical studies are performed to compare the efficiency of the proposed algorithms with other existing simulation algorithms.     

An inventory sharing and allocation method for a multi-location service parts logistics network with time-based service levels

We consider a model to allocate stock levels at warehouses in a service parts logistics network. The network is a two-echelon distribution system with one central warehouse with infinite capacity and a number of local warehouses, each facing Poisson demands from geographically dispersed customers. Each local warehouse uses a potentially different base stock policy. The warehouses are collectively required to satisfy time-based service targets: Certain percentages of overall demand need to be satisfied from facilities within specified time windows. These service levels not only depend on the distance between customers and the warehouses, but also depend on the part availabilities at the warehouses. Moreover, the warehouses share their inventory as a way to increase achieved service levels, i.e., when a local warehouse is out of stock, demand is satisfied with an emergency shipment from another close-by warehouse. Observing that the problem of finding minimum-cost stock levels is an integer non-linear program, we develop an implicit enumeration-based method which adapts an existing inventory sharing model from the literature, prioritizes the warehouses for emergency shipments, and makes use of a lower bound. The results show that the proposed inventory sharing strategy results in considerable cost reduction when compared to the no-sharing case and the method is quite efficient for the considered test problems.     

An integrated inventory model with controllable lead time and distribution‐free demand

The impact of lead time reduction on an integrated periodic review inventory system comprising a single vendor and multiple buyers with a step crashing cost function and service‐level constraints is studied. The probability distribution of demand during the protection period for each buyer is unknown, but the mean and the variance are given. Each production lot of the vendor can be delivered in a number of shipments to all buyers. A minimax distribution‐free procedure with Lagrange multipliers is applied to determining the lead time, the common shipment cycle time, the target levels of replenishments and the number of shipments per production cycle so that the expected total system cost is minimized. Numerical experiments along with sensitivity analysis were performed to illustrate the effects of parameters on the decision and the total system cost. Copyright © 2009 John Wiley & Sons, Ltd.     

应对突发状况的装备备件供应网络虚拟库存策略研究

研究突发状况引起装备维修备件需求大增时,供应网络中维修站点备件库存策略问题.基于多维修站点的虚拟库构建应对突发状况的备件库存期望成本模型,考虑突发状况的发生概率和突发状况对维修站点的影响概率,比较分析了突发状况发生引起维修需求大增的情况下,维修站点独立应对和构建虚拟库横向联合应对的库存期望成本,通过算例对这两种库存期望成本模型进行了数值分析,验证了构建虚拟库应对突发状况的有效性.     

An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse

We consider a multi-item two-echelon inventory system in which the central warehouse operates under a (Q,R) policy, and the local warehouses implement basestock policy. An exact solution procedure is proposed to find the inventory control policy parameters that minimize the system-wide inventory holding and fixed ordering cost subject to an aggregate mean response time constraint at each facility.     

Inventory pooling of repairable spare parts with non-zero lateral transshipment time and delayed lateral transshipments

In this paper, we develop an analytical model to estimate several performance measures in a single-item, multi-company, repairable inventory system where complete pooling of stock is permitted among the companies. Compared to previous research, this paper is different in that both non-zero lateral transshipment time and delayed lateral transshipments are considered in the model. We model the system as a multi-dimensional Markovian problem and solve it using a two-stage solution method. The proposed method is very accurate and computationally efficient.     

Optimal lateral transshipment policies for a two location inventory problem with multiple demand classes

We consider an inventory model for spare parts with two stockpoints, providing repairable parts for a critical component of advanced technical systems. As downtime costs for these systems are expensive, ready–for–use spare parts are kept in stock to be able to quickly respond to a breakdown of a system. We allow for lateral transshipments of parts between the stockpoints upon a demand arrival. Each stockpoint faces demands from multiple demand classes. We are interested in the optimal lateral transshipment policy. There are three ways in which a demand can by satisfied: from own stock, via a lateral transshipment, or via an emergency procedure. Using stochastic dynamic programming, we characterize and prove the structure of the optimal policy, that is, the policy for satisfying the demands which minimizes the average operating costs of the system. This optimal policy is a threshold type policy, with state-dependent thresholds at each stockpoint for every demand class. We show a partial ordering in these thresholds in the demand classes. In addition, we derive conditions under which the so-called hold back and complete pooling policies are optimal, two policies that are often assumed in the literature. Furthermore, we study several model extensions which fit in the same modeling framework.     

An Optimal Mixed Batch Shipment Policy for Multiple Items in a Single-Supplier Multiple-Retailer Integrated System

This study addresses mixed batch shipment policy with common replenishment cycle for multiple items in a single-supplier multiple-retailer integrated system. The supplier produces multiple items on a single facility under a common replenishment cycle and delivers products to retailer utilizing a mixed batch shipment policy. The objective is to determine the optimal replenishment cycle, the number of shipments, and the structure of mixed shipment, all of which minimize the integrated total cost per unit time. The single-item isolation model is constructed first, and the single-item isolation model is then integrated into the single-item integration model. Moreover, the single-item integration model is integrated into the multi-item integration model. The minimum total cost model is transformed into a maximum replenishment cycle model to optimize the structure of the mixed batch shipment. The replenishment cycle division method is then developed to obtain the optimal solutions to the subject problem. Examples are presented to illustrate the procedures involved in the replenishment cycle division method.     

An index heuristic for transshipment decisions in multi-location inventory systems based on a pairwise decomposition

In multi-location inventory systems, transshipments are often used to improve customer service and reduce cost. Determining optimal transshipment policies for such systems involves a complex optimisation problem that is only tractable for systems with few locations. Consequently simple heuristic transshipment policies are often applied in practice. This paper develops an approximate solution method which applies decomposition to reduce a Markov decision process model of a multi-location inventory system into a number of models involving only two locations. The value functions from the subproblems are used to estimate the fair charge for the inventory provided in a transshipment. This estimate of the fair charge is used as the decision criterion in a heuristic transshipment policy for the multi-location system. A numerical study shows that the proposed heuristic can deliver considerable cost savings compared to the simple heuristics often used in practice.