Computing globally optimal (s,S,T) inventory policies

We consider a single-echelon inventory installation under the (s,S,T) periodic review ordering policy. Demand is stationary random and, when unsatisfied, is backordered. Under a standard cost structure, we seek to minimize total average cost in all three policy variables; namely, the reorder level s, the order-up-to level S and the review interval T. Considering time to be continuous, we first model average total cost per unit time in terms of the decision variables. We then show that the problem can be decomposed into two simpler sub-problems; namely, the determination of locally optimal solutions in s and S (for any T) and the determination of the optimal T. We establish simple bounds and properties that allow solving both these sub-problems and propose a procedure that guarantees global optimum determination in all policy variables via finite search. Computational results reveal that the usual practice of not treating the review interval as a decision variable may carry severe cost penalties. Moreover, cost differences between (s,S,T) and other standard periodic review policies, including the simple base stock policy, are rather marginal (or even zero), when all policies are globally optimized. We provide a physical interpretation of this behavior and discuss its practical implications.     

Improving spare parts inventory control at a repair shop

We study spare parts inventory control for an aircraft component repair shop. Inspection of a defective component reveals which spare parts are needed to repair it, and in what quantity. Spare part shortages delay repairs, while aircraft operators demand short component repair times. Current spare parts inventory optimization methods cannot guarantee the performance on the component level, which is desired by the operators. To address this shortfall, our model incorporates operator requirements as time-window fill rate requirements for the repair turnaround times for each component type. In alignment with typical repair shop policies, spare parts are allocated on a first come first served basis to repairs, and their inventory is controlled using (s, S) policies. Our solution approach applies column generation in an integer programming formulation. A novel method is developed to solve the related pricing problem. Paired with efficient rounding procedures, the approach solves real-life instances of the problem, consisting of thousands of spare parts and components, in minutes.A case study at a repair shop reveals how data may be obtained in order to implement the approach as an automated method for decision support. We show that the implementation ensures that inventory decisions are aligned with performance targets.     

A method of spare parts inventory planning

A mathematical and simulation technique is discussed to obtain integer (s1, S) solutions for a group of part numbers at spares stocking locations. The technique utilizes cost function based on stochastic integer (s, S) inventory model formulation. The results are successfully implemented to plan several million dollars of spares inventory and to plan multi-echelon initial spares provisioning in the field.     

An echelon inventory-based single-stage cost function for a two-station tandem system

We propose an alternative cost-accounting function for inventory control problems on a make-to-stock setting. Our proposal is based on observing that the traditional holding and backlog parameters introduce some odd short term distortions on the inventory state space. Our single-stage cost function accounts for echelon inventories and possesses a pair of cost parameters for each echelon inventory variable, depending on whether it is positive or negative. With the modified cost-accounting function, we study a twostation tandem system producing a single product, and investigate how it compares with the performances obtained with the usual single-stage cost function. The results available so far show that the optimal policies approach a multi-echelon base stock structure for each machine. Also, the service levels achieved are better under the modified function without increasing the levels of finished goods inventory.     

Analysis and Management of Periodic Review,Order‐Up‐To Level Inventory Systems with Order Crossover

In this article, we investigate the (R, S) periodic review, order‐up‐to level inventory control system with stochastic demand and variable leadtimes. Variable leadtimes can lead to order crossover, in which some orders arrive out of sequence. Most theoretical studies of order‐up‐to inventory systems under variable leadtimes assume that crossovers do not occur and, in so doing, overestimate the standard deviation of the realized leadtime distribution and prescribe policies that can inflate inventory costs. We develop a new analytic model of the expected costs associated with this system, making use of a novel approximation of the realized (reduced) leadtime standard deviation resulting from order crossovers. Extensive experimentation through simulation shows that our model closely approximates the true expected cost and can be used to find values of R and S that provide an expected cost close to the minimum cost. Taking account of, as opposed to ignoring, crossovers leads, on average, to substantial improvements in accuracy and significant cost reductions. Our results are particularly useful for managers seeking to reduce inventory costs in supply chains with variable leadtimes.     

Replenishment Policies for Multi‐Product Stochastic Inventory Systems with Correlated Demand and Joint‐Replenishment Costs

This study analyzes optimal replenishment policies that minimize expected discounted cost of multi‐product stochastic inventory systems. The distinguishing feature of the multi‐product inventory system that we analyze is the existence of correlated demand and joint‐replenishment costs across multiple products. Our objective is to understand the structure of the optimal policy and use this structure to construct a heuristic method that can solve problems set in real‐world sizes/dimensions. Using an MDP formulation we first compute the optimal policy. The optimal policy can only be computed for problems with a small number of product types due to the curse of dimensionality. Hence, using the insight gained from the optimal policy, we propose a class of policies that captures the impact of demand correlation on the structure of the optimal policy. We call this class (s, c, d, S)‐policies, and also develop an algorithm to compute good policies in this class, for large multi‐product problems. Finally using an exhaustive set of computational examples we show that policies in this class very closely approximate the optimal policy and can outperform policies analyzed in prior literature which assume independent demand. We have also included examples that illustrate performance under the average cost objective.     

Optimal Ordering Policies for Inventory Problems With Dynamic Information Delays

Information delays exist when the most recent inventory information available to the Inventory Manager (IM) is dated. In other words, the IM observes only the inventory level that belongs to an earlier period. Such situations are not uncommon, and they arise when it takes a while to process the demand data and pass the results to the IM. We introduce dynamic information delays as a Markov process into the standard multiperiod stochastic inventory problem with backorders. We develop the concept of a reference inventory position. We show that this position along with the magnitude of the latest observed delay and the age of this observation are sufficient statistics for finding the optimal order quantities. Furthermore, we establish that the optimal ordering policy is of state‐dependent base‐stock type with respect to the reference inventory position (or state‐dependent (s, S) type if there is a fixed ordering cost). The optimal base stock and (s, S) levels depend on the magnitude of the latest observed delay and the age of this observation. Finally, we study the sensitivity of the optimal base stock and the optimal cost with respect to the sufficient statistics.     

POWER APPROXIMATIONS FOR A TWO-ECHELON INVENTORY SYSTEM USING SERVICE LEVELS

We consider a two-echelon inventory system with one warehouse and several stores. The warehouse as well as the stores are controlled by periodic review (s, S) inventory policies. We study the interrelationship between the safety stocks at the warehouse and the stores. Stockouts at the warehouse will result in supply delays to the stores and cause the lead time to be stochastic. The stores may react by increasing their safety stock. However, there is a trade-off between the safety stock at the warehouse and the safety stock at the stores. We use a service level at the warehouse to quantify the effect of warehouse stockouts on the lead time to the stores. The service level at the warehouse is considered a decision variable to find the best compromise between the various safety stocks by minimizing the overall costs. Using power approximations for the (s, S) policies, we provide an iterative procedure for adjusting the lead time distribution to the stores; this can result in substantial savings, but it doesn't guarantee the overall optimality. Numerical studies are provided to test the accuracy of approximations. The effects of the different system parameters on the inventory policy give general guidelines for use of the policies.     

A coordination mechanism with fair cost allocation for divergent multi-echelon inventory systems

In this paper we study the coordination of inventory control in divergent multi-echelon inventory systems under periodic review and decentralized control. Under decentralized control the installations decide upon replenishment policies that minimize their individual inventory costs. In general these policies do not coincide with the optimal policies of the system under centralized control. Hence, the total cost under decentralized control is larger than under centralized control. We present a simple coordination mechanism that removes this cost inefficiency. The upstream installations increases its base stock level while the downstream installations compensate their supplier for increased costs and provide it with additional side payments. We show that this mechanism coordinates the system; the global optimal policy of the system is the unique Nash equilibrium of the corresponding strategic game. Furthermore, the mechanism results in a fair allocation of the costs; all installations enjoy cost savings.     

Contracting Under Vendor Managed Inventory Systems Using Holding Cost Subsidies

Vendor managed inventory systems are becoming increasingly popular. An important issue in implementing a vendor managed inventory scheme is the contracting terms that dictate the ownership of the inventory and the responsibility of inventory replenishment decisions. Thus the performance of a vendor managed system crucially depends on these terms and on how inventory‐related costs are shared in a supply chain. We consider a system where a manufacturer supplies a single product to a retailer who faces random demand in a competitive market. The retailer incurs a fixed cost per order, inventory holding cost, and a penalty cost for a stockout (unsatisfied demand is back‐ordered). Further, the manufacturer incurs a penalty cost when there is a stockout at the retailer and a fixed replenishment cost. We assume that the players are rational and act noncooperatively. We compare the performance of retailer managed inventory systems, where the retailer places orders and makes replenishment decisions, with vendor managed inventory systems, wherein the vendor or manufacturer makes inventory and replenishment decisions. Specifically, in the vendor managed inventory system, we propose and evaluate holding cost subsidy‐type contracts on inventories offered by the retailer to improve system performance. We evaluate this contract in the context of three widely used inventory systems—deterministic economic order quantity, continuous review (Q, r) policies, and periodic review policies—and show when such contracts may improve channel performance.     

Inventory control with seasonality of lead times

The practical challenges posed by the seasonality of lead times have largely been ignored within the inventory control literature. The length of the seasons, as well as the length of the lead times during a season, may demonstrate cyclical patterns over time. This study examines whether inventory control policies that anticipate seasonal lead-time patterns can reduce costs. We design a framework for characterizing different seasonal lead-time inventory problems. Subsequently, we examine the effect of deterministic and stochastic seasonal lead times within periodic review inventory control systems. We conduct a base case analysis of a deterministic system, enabling two established and alternating lead-time lengths that remain valid through known intervals. We identify essential building blocks for developing solutions to seasonal lead-time problems. Lastly, we perform numerical experiments to evaluate the cost benefits of implementing an inventory control policy that incorporates seasonal lead-time lengths. The findings of the study indicate the potential for cost improvements. By incorporating seasonality in length of seasons and length of lead times within the season into the control models, inventory controllers can make more informed decisions when ordering their raw materials. They need smaller buffers against lead-time variations due to the cyclical nature of seasonality. Reductions in costs in our experiments range on average between 18.9 and 26.4% (depending on safety time and the probability of the occurrence of stock out). Therefore, inventory control methods that incorporate seasonality instead of applying large safety stock or safety time buffers can lead to substantial cost reductions.     

连续生产模式下的不常用备件联合采购优化分析

针对连续性生产企业不常用备件管理缺货费用难以确定的实际情况,讨论了服务水平约束的基于随机连续盘点策略的联合补充(s,C,S)随机库存问题,经与单独补充策略相比,发现其经济效益明显。同时对影响备件联合采购费用节约的因素进行敏感性分析,指出了进行此类备件库存优化的方向。     

RETAIL INVENTORY CONTROL WITH LOST SALES,SERVICE CONSTRAINTS,AND FRACTIONAL LEAD TIMES

This paper describes a periodic review, fixed lead time, single-product, single-facility model with random demand, lost sales and service constraints that was developed for potential application at a Western Canadian retailer. The objective of this study was to determine optimal (s, S) policies for a large number of products and locations. To this end, we evaluate the long run average cost and service level for a fixed (s, S) policy and then used a search procedure to locate an optimal policy. The search procedure is based on an efficient updating scheme for the transition probability matrix of the underlying Markov chain, bounds on S and monotonicity assumptions on the cost and service level functions. A distinguishing feature of this model is that lead times are shorter than review periods so that the stationary analysis underlying computation of costs and service levels requires subtle analyses. We compared the computed policies to those currently in use on a test bed of 420 products and found that stores currently hold inventories that are 40% to 50% higher than those recommended by our model and estimate that implementing the proposed policies for the entire system would result in significant cost savings.     

Inventory Models with Continuous and Poisson Demands and Discounted and Average Costs

We develop a new, unified approach to treating continuous‐time stochastic inventory problems with both the average and discounted cost criteria. The approach involves the development of an adjusted discounted cycle cost formula, which has an appealing intuitive interpretation. We show for the first time that an (s, S) policy is optimal in the case of demand having a compound Poisson component as well as a constant rate component. Our demand structure simultaneously generalizes the classical EOQ model and the inventory models with Poisson demand, and we indicate the reasons why this task has been a difficult one. We do not require the surplus cost function to be convex or quasi‐convex as has been assumed in the literature. Finally, we show that the optimal s is unique, but we do not know if optimal S is unique.     

Unsold Versus Unbought Commitment: Minimum Total Commitment Contracts with Nonzero Setup Costs

We study a minimum total commitment (MTC) contract embedded in a finite‐horizon periodic‐review inventory system. Under this contract, the buyer commits to purchase a minimum quantity of a single product from the supplier over the entire planning horizon. We consider nonstationary demand and per‐unit cost, discount factor, and nonzero setup cost. Because the formulations used in existing literature are unable to handle our setting, we develop a new formulation based on a state transformation technique using unsold commitment instead of unbought commitment as state variable. We first revisit the zero setup cost case and show that the optimal ordering policy is an unsold‐commitment‐dependent base‐stock policy. We also provide a simpler proof of the optimality of the dual base‐stock policy. We then study the nonzero setup cost case and prove a new result, that the optimal solution is an unsold‐commitment‐dependent (s, S) policy. We further propose two heuristic policies, which numerical tests show to perform very well. We also discuss two extensions to show the generality of our method's effectiveness. Finally, we use our results to examine the effect of different contract terms such as duration, lead time, and commitment on buyer's cost. We also compare total supply chain profits under periodic commitment, MTC, and no commitment.     

Rolling horizon master production schedule performance: A policy analysis

In this paper, a simulation experiment has been developed to examine the combined influence of the design, inventory and environmental factors on the cost performance of a rolling horizon master production schedule. Specifically, a 2 5 factorial design was used to examine the effects associated with three rolling schedule design policies, one inventory policy and one environmental condition of forecast error on MPS cost performance. The study was based on actual data from a paint company. Results suggest that the choice of appropriate lot-size and inventory policies have a significant influence on MPS costs and that there are indeed important interactions between these policies and other design factors of a rolling schedule.     

Coordinating replenishments in a supply chain with quality control considerations

We study the impact of coordinated replenishment, a popular supply chain initiative, on a quality control system. We use the (Q, S) policy to manage a two-item inventory control system. If the items are jointly replenished, the number ordered for each item varies from lot to lot. As the number varies, the sampling plan will also be changed. Companies have to determine sampling plans to minimize quality cost when the order is mixed with several items and the number of each item varies from order to order. Management's primary concern is to determine the optimal sampling sizes and acceptance numbers for all items in an order.     

Quantity Discount‐Based Inventory Coordination: Effectiveness and Critical Environmental Factors

It is understood that quantity discounts provide a practical foundation for coordinating inventory decisions in supply chains. The primary objective of this research is to test, under a variety of environmental conditions, the effectiveness of quantity discounts as an inventory coordination mechanism between a buyer and a supplier. A comprehensive simulation experiment with anova has been designed to investigate the impacts of (1) choice of quantity discount‐based inventory coordination policies, (2) magnitude of demand variation, (3) buyer's and supplier's relative inventory cost structure, and (4) buyer's economic time‐between‐orders on the effectiveness of supply chain inventory coordination. The analytical results confirm that the quantity discount policies have managerial properties as a mediator for inventory coordination. The results also show that the performance of quantity discount‐based inventory coordination policies is influenced significantly by environmental factors, such as the magnitude of demand variation, the buyer's and the supplier's inventory cost structure, and the buyer's economic time‐between‐orders.     

Determination of recovery effort for a probabilistic recovery system under various inventory control policies

In this study we investigate the desired level of recovery under various inventory control policies when the success of recovery is probabilistic. All the used and returned items go into a recovery process that is modelled as a single stage operation. The recovery effort is represented by the expected time spent for it. The effect of increasing recovery effort on the success probability together with unit cost of the operation is included by assuming general forms of dependencies. Alternative to recovered items, demand is satisfied by brand-new items. Four inventory control policies that differ in timing of and information used in purchasing decision are proposed. The objective is to find the recovery level together with inventory control parameter that minimize the long-run average total cost. A numerical study covering a wide range of system parameters is carried out. Finally computational results are presented with their managerial implications.     

Single cycle policies for the one-warehouse N-retailer inventory/distribution system

We address a multi-echelon inventory system with one-warehouse and N  -retailers. The demand at each retailer is assumed to be known and satisfied by the warehouse. Shortages are not allowed and lead times are negligible. Costs at each facility consist of a fixed charge per order and a holding cost. The goal is to determine single-cycle policies which minimize the average cost per unit time, that is, the sum of the average holding and setup costs per unit time at the retailers and at the warehouse. We propose a O(NlogN)$\mathrm{O}(N\log N)$ heuristic procedure to compute efficient single-cycle policies. This heuristic is compared with other approaches proposed by Schwarz, Graves and Schwarz and Muckstadt and Roundy. We carry out a computational study to test the effectiveness of the heuristic and to compare the performance of the different procedures. From the computational results, it is shown that the new heuristic provides, on average, better single-cycle policies than those given by the Muckstadt and Roundy method.