A serial inventory system with supplier selection and order quantity allocation

Given the prevalence of both supplier selection and inventory control problems in supply chain management, this article addresses these problems simultaneously by developing a mathematical model for a serial system. This model determines an optimal inventory policy that coordinates the transfer of items between consecutive stages of the system while properly allocating orders to selected suppliers in stage 1. In addition, a lower bound on the minimum total cost per time unit is obtained and a 98% effective power-of-two (POT) inventory policy is derived for the system under consideration. This POT algorithm is advantageous since it is simple to compute and yields near optimal solutions.     

A new algorithm and a new heuristic for serial supply systems

We present a new dynamic programming formulation for the stochastic multi-stage serial inventory system based on the cost of sub-system with fewer stages. A heuristic based on judiciously selected common downstream holding costs requires solving one newsvendor problem per stage. A closed-form approximate upper bound allows for accurate sensitivity analysis.     

Stochastic leadtimes in a one-warehouse,N-retailer inventory system with the warehouse not carrying stock

This study extends upon a multi-echelon inventory model developed by Graves, introducing in the one-warehouse, N-retailer case—as Graves suggested—stochastic leadtimes between the warehouse and the retail sites in place of the original deterministic leadtimes. Effects of stochastic leadtimes on required base stock levels at the retail sites in the case where the warehouse carries no stock (e.g., serves as a cross-dock point) were investigated analytically. Two alternative treatments of stochastic leadtime distributions were considered. Using as a baseline Graves’ computational study under deterministic leadtimes, results of the current study suggest that it may be better to use the deterministic model with an accurately estimated mean leadtime than a stochastic model with a poorly estimated mean leadtime.     

Robust multi-echelon multi-period inventory control

We consider the problem of minimizing the overall cost of a supply chain, over a possible long horizon, under demand uncertainly which is known only crudely. Under such circumstances, the method of choice is Robust Optimization, in particular the Affinely Adjustable Robust Counterpart (AARC) method which leads to tractable deterministic optimization problems. The latter is due to a recent re-parametrization technique for discrete time linear control systems. In this paper we model, analyze and test an extension of the AARC method known as the Globalized Robust Counterpart (GRC) in order to control inventories in serial supply chains. A simulation study demonstrates the merit of the methods employed here, in particular, it shows that a good control law that minimizes cost achieves simultaneously good control of the bullwhip effect.     

A sample-path approach to the optimality of echelon order-up-to policies in serial inventory systems

We present a new proof of the optimality of echelon order-up-to policies in serial inventory systems, first proved by Clark and Scarf. Our proof is based on a sample-path analysis as opposed to the original proof based on dynamic programming induction.     

An integrated guaranteed- and stochastic-service approach to inventory optimization in supply chains

Multi-echelon inventory optimization literature distinguishes stochastic- (SS) and guaranteed-service (GS) approaches as mutually exclusive frameworks. While the GS approach considers flexibility measures at the stages to deal with stockouts, the SS approach only relies on safety stock. Within a supply chain, flexibility levels might differ between stages rendering them appropriate candidates for one approach or the other. The existing approaches, however, require the selection of a single framework for the entire supply chain instead of a stage-wise choice. We develop an integrated hybrid-service (HS) approach which endogenously determines the overall cost-optimal approach for each stage and computes the required inventory levels. We present a dynamic programming optimization algorithm for serial supply chains that partitions the entire system into subchains of different types. From a numerical study we find that, besides implicitly choosing the better of the two pure frameworks, whose cost differences can be considerable, the HS approach enables additional pipeline and on-hand stock cost savings. We further identify drivers for the preferability of the HS approach.     

Evaluation of stock allocation policies in a divergent inventory system with shipment consolidation

In this paper we consider a one-warehouse N-retailer inventory system characterized by access to real-time point-of-sale data, and a time based dispatching and shipment consolidation policy at the warehouse. More precisely, inventory is reviewed continuously, while a consolidated shipment (for example, a truck) to all retailers is dispatched from the warehouse at regular time intervals. The focus is on investigating the cost benefits of using state-dependent myopic allocation policies instead of a simple FCFS (First-Come-First-Serve) rule to allocate shipped goods to the retailers. The analysis aims to shed some light on when, if ever, FCFS is a reasonable policy to use in this type of system? The FCFS allocations of items to retailers are determined by the sequence in which retailer orders (or equivalently customer demands) arrive to the warehouse. Applying the myopic policy enables the warehouse to postpone the allocation decision to the moment of shipment (from the warehouse) or the moments of delivery (to the different retailers), and to base it on the inventory information available at those times. The myopic allocation method we study is often used in the literature on periodic review systems.     

Finding the optimal CSP inventory level for multi-echelon system in Air Force using random effects regression model

Determining the optimal inventory level of CSP (concurrent spare parts) is crucial at the time of acquisition of new aircrafts. Most of the existing optimal CSP models do not take into account the time varying characteristics of CSP even though their demand rates are sensitive to such variation. In this paper, we introduce the CSP inventory model using a two stage approach. At the first stage, we use a random effects model to predict the expected demand of CSP in a multi-echelon system consisting of depot and bases based on CSPs varying characteristics with time. At the second stage, we find the optimal inventory level of CSP by using the optimization algorithm with various constraints under limited budget. The study is expected to contribute to the Air Force establishing the optimal national defense procurement policy for CSP of aircrafts.     

Performance evaluation of a multi-echelon production,transportation and distribution system: A matrix analytical approach

This study proposes an originative method to evaluate complex supply chains. A tentative multi-echelon production, transportation and distribution system with stochastic factors built-in is employed as a test bed for the proposed method. The supply subsystem formulated in this study is a two-stage production facility with constant probability of feedback and stochastic breakdowns. The transportation subsystem is a service facility with one server. The distribution subsystem under study is a single central warehouse with M retailers. All the participants of the supply chain use base-stock policies and single-server settings. We investigated both the make-to-order (MTO) and make-to-stock (MTS) policies for different base-stock levels, as adopted at different sites. Applying quasi-birth-and-death (QBD) processes as decomposed building blocks and then using the existing matrix analytical computing approach for the performance evaluation of a tandem queue constitutes the main procedure of this study. We also discuss the possibilities of extending the current model to account for other inventory control policies as well as for multi-server case. Numerical study shows our proposed analytical model is robust for practical use.     

Efficient computation of time-based customer service levels in a multi-item, multi-echelon supply chain: A practical approach for inventory optimization

Time-based item fill rates, or “channel” fill rates, are the building blocks needed to evaluate steady-state compliance with time-based customer service agreements. Exact computation of channel fill rates is both difficult and time-consuming, yet their accurate assessment is essential for system-wide inventory optimization. We describe and validate a practical method for computing channel fill rates in a multi-item, multi-echelon service parts distribution system. A simulation study is presented which shows that, in a three-echelon setting, our estimation errors are very small over a wide range of base stock level vectors. A more accurate, though less efficient, approximation method is also evaluated for comparison.