Performance Evaluation of Stochastic Multi-Echelon Inventory Systems: A Survey

Globalization, product proliferation, and fast product innovation have significantly increased the complexities of supply chains in many industries. One of the most important advancements of supply chain management in recent years is the development of models and methodologies for controlling inventory in general supply networks under uncertainty and their widefspread applications to industry. These developments are based on three generic methods: the queueing-inventory method, the lead-time demand method and the flow-unit method. In this paper, we compare and contrast these methods by discussing their strengths and weaknesses, their differences and connections, and showing how to apply them systematically to characterize and evaluate various supply networks with different supply processes, inventory policies, and demand processes. Our objective is to forge links among research strands on different methods and various network topologies so as to develop unified methodologies.Masdar Institute of Science and TechnologyNational Science Foundation (U.S.) (NSF Contract CMMI-0758069)National Science Foundation (U.S.) (Career Award CMMI-0747779)Bayer Business ServicesSAP A

Computing (R, S) policies with correlated demand

This paper considers the single-item single-stocking non-stationary stochastic lot-sizing problem under correlated demand. By operating under a nonstationary (R, S) policy, in which R denote the reorder period and S the associated order-up-to-level, we introduce a mixed integer linear programming (MILP) model which can be easily implemented by using off-theshelf optimisation software. Our modelling strategy can tackle a wide range of time-seriesbased demand processes, such as autoregressive (AR), moving average(MA), autoregressive moving average(ARMA), and autoregressive with autoregressive conditional heteroskedasticity process(AR-ARCH). In an extensive computational study, we compare the performance of our model against the optimal policy obtained via stochastic dynamic programming. Our results demonstrate that the optimality gap of our approach averages 2.28% and that computational performance is good

An enhanced approximation mathematical model inventorying items in a multi-echelon system under a continuous review policy with probabilistic demand and lead-time

An inventory system attempts to balance between overstock and understock to reduce the total cost and achieve customer demand in a timely manner. The inventory system is like a hidden entity in a supply chain, where a large complete network synchronizes a series of interrelated processes for a manufacturer, in order to transform raw materials into final products and distribute them to customers. The optimality of inventory and allocation policies in a supply chain for a cement industry is still unknown for many types of multi-echelon inventory systems. In multi-echelon networks, complexity exists when the inventory issues appear in multiple tiers and whose performances are significantly affected by the demand and lead-time. Hence, the objective of this research is to develop an enhanced approximation mathematical model in a multi-echelon inventory system under a continuous review policy subject to probabilistic demand and lead-time. The probability distribution function of demand during lead-time is established by developing a new Simulation Model of Demand During Lead-Time (SMDDL) using simulation procedures. The model is able to forecast future demand and demand during lead-time. The obtained demand during lead-time is used to develop a Serial Multi-echelon Inventory (SMEI) model by deriving the inventory cost function to compute performance measures of the cement inventory system. Based on the performance measures, a modified distribution multi-echelon inventory (DMEI) model with the First Come First Serve (FCFS) rule (DMEI-FCFS) is derived to determine the best expected waiting time and expected number of retailers in the system based on a mean arrival rate and a mean service rate. This research established five new distribution functions for the demand during lead-time. The distribution functions improve the performance measures, which contribute in reducing the expected waiting time in the system. Overall, the approximation model provides accurate time span to overcome shortage of cement inventory, which in turn fulfil customer satisfaction

Multilocation Inventory Systems With Centralized Information.

The management of multi-echelon inventory systems has been both an important and challenging research area for many years. The rapid advance in information technology and the emphasis on integrated supply chain management have new implications for the successful operation of distribution systems. This research focuses on the study of some fundamental issues related to the operation of a multilocation inventory system with centralized information. First, we do a comparative analysis to evaluate the overall performance of individual versus centralized ordering policies for a multi-store distribution system where centralized information is available. This study integrates the existing research and clarifies one of the fundamental questions facing inventory managers today: whether or not ordering decisions should be centralized. Next, we consider a multi-store distribution system where emergency transshipments are permitted among these stores. Based on some simplifying assumptions, we develop an integrated model with a joint consideration of inventory and transshipment components. An approximately optimal (s, S) policy is obtained through a dynamic programming technique. This ordering policy is then compared with a simplified policy that assumes free and instantaneous transshipments. We also examine the relative performance of base stock policies for a centralized-ordering distribution system. Numerical studies are provided to give general guidelines for use of the policies

A characterization of optimal base-stock levels for a continuous-stage serial supply chain

In this paper, we present a continuous model to optimize multi-echelon inventory management decisions under stochastic demand. Observing that in such continuous system it is never optimal to let orders cross, we decompose the general problem into a set of single-unit sub-problems that can be solved in a sequential fashion. When shipping and inventory holding costs are linear in the stage, we show that it is optimal to move the unit associated with the k-th next customer if and only if the inventory unit is held in an echelon located within a given interval. This optimal policy can be interpreted as an echelon base-stock policy such that the base-stock is initially increasing and then decreasing in the stage. We also characterize the optimal policy when costs are piecewise-constant. Finally, we study the sensitivity of the optimal base-stock levels to the cost structures.multi-echelon; optimal control; unit-tracking decomposition;

Performance Analysis of Multi-Echelon Inventory Systems.

A two-echelon inventory and distribution system consisting of a centralized warehouse and N stores is considered in this paper. The inventories of the warehouse as well as the stores are controlled by periodic review (s,S) ordering policies. The expected levels of capital investment, storage space needs, capacity requirements for delivery vehicles, and reliable customer service are issues of great importance to practitioners when considering the introduction of a central warehouse and transportation system. Helmut Schneider, Dan Rinks, and Peter Kelle have developed a methodology that has been shown to provide approximately optimal (s,S) policies under various demand conditions, and are easy to handle computationally. The approximations of Schneider et al., are used to generate ordering policies for the two-echelon system in order to observe the behavior of the aggregate inventories generated by the (s,S) policies using computer simulation. The simulation results are used to evaluate the accuracy of the analytic models in predicting the aggregate inventory behavior, and simple computational formulas are proposed to calculate confidence limits for aggregate inventory levels and for shipping volumes and weights

Applications of robust optimization to queueing and inventory systems

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2011.Cataloged from PDF version of thesis.Includes bibliographical references (p. 105-111).This thesis investigates the application of robust optimization in the performance analysis of queueing and inventory systems. In the first part of the thesis, we propose a new approach for performance analysis of queueing systems based on robust optimization. We first derive explicit upper bounds on performance for tandem single class, multiclass single server, and single class multi-server queueing systems by solving appropriate robust optimization problems. We then show that these bounds derived by solving deterministic optimization problems translate to upper bounds on the expected steady-state performance for a variety of widely used performance measures such as waiting times and queue lengths. Additionally, these explicit bounds agree qualitatively with known results. In the second part of the thesis, we propose methods to compute (s,S) policies in supply chain networks using robust and stochastic optimization and compare their performance. Our algorithms handle general uncertainty sets, arbitrary network topologies, and flexible cost functions including the presence of fixed costs. The algorithms exhibit empirically practical running times. We contrast the performance of robust and stochastic (s,S) policies in a numerical study, and we find that the robust policy is comparable to the average performance of the stochastic policy, but has a considerably lower standard deviation across a variety of networks and realized demand distributions. Additionally, we identify regimes when the robust policy exhibits particular strengths even in average performance and tail behavior as compared with the stochastic policy.by Alexander Anatolyevich Rikun.Ph.D