A periodic-review inventory control policy for a two-level supply chain with multiple retailers and stochastic demand

We consider a time-based inventory control policy for a two-level supply chain with one warehouse and multiple retailers in this paper. Let the warehouse order in a fixed base replenishment interval. The retailers are required to order in intervals that are integer-ratio multiples of the base replenishment interval at the warehouse. The warehouse and the retailers each adopt an order-up-to policy, i.e. order the needed stock at a review point to raise the inventory position to a fixed order-up-to level. It is assumed that the retailers face independent Poisson demand processes and no transshipments between them are allowed. The contribution of the study is threefold. First, we assume that when facing a shortage the warehouse allocates the remaining stock to the retailers optimally to minimize system cost in the last minute before delivery and provide an approach to evaluate the exact system cost. Second, we characterize the structural properties and develop an exact optimal solution for the inventory control system. Finally, we demonstrate that the last minute optimal warehouse stock allocation rule we adopt dominates the virtual allocation rule in which warehouse stock is allocated to meet retailer demand on a first-come first-served basis with significant cost benefits. Moreover, the proposed time-based inventory control policy can perform equally well or better than the commonly used stock-based batch-ordering policy for distribution systems with multiple retailers.     

Optimal pricing and inventory policies: Centralized and decentralized decision making

The paper studies an optimal control problem of pricing and inventory replenishment in a system with serial inventories. Consumer demand for a specific product at a retail outlet depends on price as well as the in-store stock of the product. The hypothesis is that for certain consumer products, a large volume of displayed goods leads consumers to buy more than if the stock is small. In addition to the stock that is on display in the store, there is an inventory of the product in a central warehouse. First we consider a setup in which management of the two stocks is decentralized such that pricing decisions are made by the store manager who also decides on the level of in-store inventory. The warehouse manager makes the replenishment decisions concerning the stock in the warehouse. Next we study the problem where stock management and pricing decisions are centralized. Optimal trajectories for inventories, replenishment rates, and retail price are derived by using phase diagrams and a formal synthesizing procedure.     

A two-echelon inventory model with lost sales

This paper considers a single-item, two-echelon, continuous-review inventory model. A number of retailers have their stock replenished from a central warehouse. The warehouse in turn replenishes stock from an external supplier. The demand processes on the retailers are independent Poisson. Demand not met at a retailer is lost. The order quantity from each retailer on the warehouse and from the warehouse on the supplier takes the same fixed value Q, an exogenous variable determined by packaging and handling constraints. Retailer i follows a (Q, R_i) control policy. The warehouse operates an (SQ, (S − 1)Q) policy, with non-negative integer S. If the warehouse is in stock then the lead time for retailer i is the fixed transportation time L_i from the warehouse to that retailer. Otherwise retailer orders are met, after a delay, on a first-come first-served basis. The lead time on a warehouse order is fixed. Two further assumptions are made: that each retailer may only have one order outstanding at any time and that the transportation time from the warehouse to a retailer is not less than the warehouse lead time. The performance measures of interest are the average total stock in the system and the fraction of demand met in the retailers. Procedures for determining these performance measures and optimising the behaviour of the system are developed.     

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.     

Stock Rationing in a Continuous Review Two-Echelon Inventory Model

In this paper we consider a 1-warehouse, N-retailer inventory system where demand occurs at all locations. We introduce an inventory model which allows us to set different service levels for retailers and direct customer demand at the warehouse. For each retailer a critical level is defined, such that a retailer replenishment order is delivered from warehouse stock if and only if the stock level exceeds this critical level. It is assumed that retailer replenishment orders, which are not satisfied from warehouse stock, are delivered directly from the outside supplier, instead of being backlogged. We present an analytical upper bound on the total cost of the system, and develop a heuristic method to optimize the policy parameters. Numerical experiments indicate that our technique provides a very close approximation of the exact cost. Also, we show that differentiating among the retailers and direct customer demand can yield significant cost reductions.     

Exception Auditing: (The Audit of Empty Locations)

This is a technique for selecting warehouse locations for auditing such that effort is spent only on the slow moving stock. There is an inherent assumption that material is audited as it leaves the warehouse by the normal checking procedures.This paper deals with the mathematics behind the practical implementation of exception auditing.     

The one-warehouse multi-retailer problem: reformulation, classification, and computational results

We consider the one-warehouse multi-retailer problem where a warehouse replenishes multiple retailers with deterministic dynamic demands over a horizon. The problem is to determine when and how much to order to the warehouse and retailers such that the total system-wide costs are minimized. We propose a new (combined transportation and shortest path based) integer programming reformulation for the problem in addition to the echelon stock and transportation based formulations in the literature. We analyze the strength of the LP relaxations of three formulations and show that the new formulation is stronger than others. We also show that the new and transportation based formulations are equivalent for the joint replenishment problem, where the warehouse is a crossdocking facility. We extend all formulations to the case with initial inventory at the warehouse and reveal the relation among their LP relaxations. We present our computational experiments with all formulations over a set of randomly generated test instances.     

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.     

销售率线性依赖瞬时库存水平的两货栈决策模型

在成熟期的存货影响销售环境下,考虑销售率线性依赖瞬时库存水平,不允许缺货,研究了一类非变质性物品的两货栈库存决策问题.建立了以系统平均总利润最大为目标的决策模型,分析了系统最优库存策略的存在性和唯一性,并给出了求解模型的有效方法.分析结果表明,库存管理者利用租用货栈进行订货决策时,除了要充分考虑企业自身的库存容量外,还取决于自有货栈产品相关参数对库存系统绩效的边际贡献率.     

Linear programming based decomposition methods for inventory distribution systems

We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse replenishes its stock from an external supplier. The objective is to minimize the total expected replenishment, holding and backlogging cost over a finite planning horizon. The problem can be formulated as a dynamic program, but this dynamic program is difficult to solve due to its high dimensional state variable. It has been observed in the earlier literature that if the warehouse is allowed to ship negative quantities to the retailers, then the problem decomposes by the locations. One way to exploit this observation is to relax the constraints that ensure the nonnegativity of the shipments to the retailers by associating Lagrange multipliers with them, which naturally raises the question of how to choose a good set of Lagrange multipliers. In this paper, we propose efficient methods that choose a good set of Lagrange multipliers by solving linear programming approximations to the inventory distribution problem. Computational experiments indicate that the inventory replenishment policies obtained by our approach can outperform several standard benchmarks by significant margins.     

Controlling distribution inventory systems with shipment consolidation and compound Poisson demand

We consider a one-warehouse-multiple-retailer inventory system where the retailers face stochastic customer demand, modelled as compound Poisson processes. Deliveries from the central warehouse to groups of retailers are consolidated using a time based shipment consolidation policy. This means that replenishment orders have to wait until a vehicle departures, which increases the lead time for the retailers and therefore also the safety stock. Thus, a trade-off exists between expected shipment costs and holding costs. Our aim is to determine the shipment intervals and the required amount of safety stock for each retailer and the warehouse to minimize total cost, both for backorder costs and fill rate constraints. Previous work has focused on exact solutions which are computationally demanding and not applicable for larger real world problems. The focus of our present work is on the development of computationally attractive heuristics that can be applied in practice. A numerical study shows that the proposed heuristics perform well compared to the exact cost minimizing solutions. We also illustrate that the approaches are appropriate for solving real world problems using data from a large European company.     

Alternative Inventory and Distribution Policies of a Food Manufacturer

Alternative distribution strategies for delivering to a retailer's regional depots are compared. These include supplying all the manufacturer's warehouses from the factory and allowing every possible lateral transshipment with partial stock rebalancing over different time periods. The principal alternative is to have a hierarchical system. Effects of making emergency transfers to deliberately delayed delivery vehicles are evaluated. A data stream of actual demands for a typical product is used and forecasts are made over different time periods for production planning, warehouse allocations and transshipments. The conclusions are examined for various production frequencies and levels of stock cover.     

A model for a Mixed Continuous-Periodic Review One-Warehouse,N-Retailer inventory system

This paper analyzes a Mixed Continuous-Periodic Review One-Warehouse, N-Retailer inventory system for a single, consumable item. In this system, the warehouse holds stock and the retailers experience independent, stationary field demand. Each retailer follows a continuous review (Q, r) policy. However, the warehouse reviews each retailer according to a review interval T. We discuss the motivation for this warehouse policy and show how its impact on the retailers can be modeled with an (nQ, r, T) policy at the retailers and the warehouse. Then we present an approximate analytical model to predict the performance of such a system under different operating conditions. An interesting aspect of the model is the estimation of warehouse demand variance via a closed form expression derived using renewal theory. We compare the approximate model with a simulation model to test its accuracy. The comparison indicates that the approximate model predicts quite accurately in high fill rate ranges (retailer fill rates of 90% and more). Finally, we propose several extensions to this research.     

A queuing approach for inventory planning with batch ordering in multi-echelon supply chains

This paper presents stylized models for conducting performance analysis of the manufacturing supply chain network (SCN) in a stochastic setting for batch ordering. We use queueing models to capture the behavior of SCN. The analysis is clubbed with an inventory optimization model, which can be used for designing inventory policies . In the first case, we model one manufacturer with one warehouse, which supplies to various retailers. We determine the optimal inventory level at the warehouse that minimizes total expected cost of carrying inventory, back order cost associated with serving orders in the backlog queue, and ordering cost. In the second model we impose service level constraint in terms of fill rate (probability an order is filled from stock at warehouse), assuming that customers do not balk from the system. We present several numerical examples to illustrate the model and to illustrate its various features. In the third case, we extend the model to a three-echelon inventory model which explicitly considers the logistics process.     

Approximate evaluation of multi-location inventory models with lateral transshipments and hold back levels

We consider a continuous-time, single-echelon, multi-location inventory model with Poisson demand processes. In case of a stock-out at a local warehouse, a demand can be fulfilled via a lateral transshipment (LT). Each warehouse is assigned a pre-determined sequence of other warehouses where it will request for an LT. However, a warehouse can hold its last part(s) back from such a request. This is called a hold back pooling policy, where each warehouse has hold back levels determining whether a request for an LT by another warehouse is satisfied. We are interested in the fractions of demand satisfied from stock (fill rate), via an LT, and via an emergency procedure from an external source. From these, the average costs of a policy can be determined. We present a new approximation algorithm for the evaluation of a given policy, approximating the above mentioned fractions. Whereas algorithms currently known in the literature approximate the stream of LT requests from a warehouse by a Poisson process, we use an interrupted Poisson process. This is a process that is turned alternatingly On and Off for exponentially distributed durations. This leads to the On/Off overflow algorithm. In a numerical study we show that this algorithm is significantly more accurate than the algorithm based on Poisson processes, although it requires a longer computation time. Furthermore, we show the benefits of hold back levels, and we illustrate how our algorithm can be used in a heuristic search for the setting of the hold back levels.     

随机提前期随机需求条件下的二级库存模型

考虑由一个分销中心和若干零售商组成的两级分销系统 ,假设分销中心和零售商实行连续性盘点、( R,Q) 订货策略 ,分销中心的交货时间是常量 ,而零售商处的提前期为随机变量 ,且需求服从独立的复合泊松过程 .以整个系统平均成本最小为目标函数 ,由此得到最优的订货策略 ,并且给出数值例子及敏感性分析 .     

A two warehouse inventory model for deteriorating items with a linear trend in demand and shortages

In this paper, we develop a deterministic inventory model with two warehouses (one is the existing storage known as own warehouse (OW) and the other is hired on rental basis known as rented warehouse (RW). The model allows different levels of item deterioration in both warehouses. The demand rate is supposed to be a linear (increasing) function of time and the replenishment rate is infinite. The stock is transferred from RW to OW in continuous release pattern and the associated transportation cost is taken into account. Shortages in OW are allowed and excess demand is backlogged. For the general model, we give the equations for the optimal policy and cost function and we discuss some special cases. A numerical example is given to illustrate the solution procedure of the model. Finally, based on this example, we conduct a sensitivity analysis of the model.     

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).     

Optimal ordering and transfer policy for an inventory with stock dependent demand

This paper deals with an ordering-transfer inventory model to determine the retailer’s optimal order quantity and the number of transfers per order from the warehouse to the display area. It is assumed that the amount of display space is limited and the demand rate depends on the display stock level. The objective is to maximize the average profit per unit time yielded by the retailer. The proposed models and algorithms are developed to find the optimal strategy by retailer. Numerical examples are presented to illustrate the models developed and the sensitivity analysis is also reported.     

An Example of Disbenefits of Centralized Stocking

This paper deals with a single-period, single-product inventory model. It is a multilocation problem with an opportunity for centralization. In the centralized system, the location's demands are satisfied from one central warehouse whose orders are processed on a first come, first served basis. The inventory size will be constrained to meet a specific maximum probability of being out of stock at each location. Under these assumptions, Stulman argues that a centralized system requires a lower total starting inventory than the equivalent decentralized one. We shall present a counter example showing that, under conditions where an 86% probability of stockouts is the maximum acceptable, a higher total starting inventory may be required by centralizing two locations' stock-holdings.