Information Flows in Capacitated Supply Chains with Fixed Ordering Costs

Many organizations have only recently recognized that sharing information with other members in their supply chain can lead to signficant reduction in the total costs.Usually these information flows are incorporated into existing operating policies at the various parties.In this paper we argue that, in some cases, it may be necessary to change the way the supply chain is managed to make complete use of the information flows. We support this argument by analyzing a supply chain containing a capacitated supplier and a retailer facing i.i.d. demands. In addition there are fixed ordering costs between the retailer and the supplier.In this setting, we consider two models: 1 the retailer is using the optimal s,S policy and providing the supplier information about her inventory levels; and 2 the retailer, still sharing information on her inventory levels, orders in a period only if by the previous period the cumulative end-customer demand since she last ordered was greater than δ. Thus, in Model 1, information sharing is used to supplement existing policies; while, in Model 2, we have redefined operating policies to make better use of the information flows. We will show, via a detailed computational study, that the total supply chain costs of Model 2 are 10.4% lower, on the average, than that of Model 1. We noticed that this reduction in costs is higher at higher capacities, higher supplier penalty costs, lower retailer penalty costs, moderate values of set-up cost, and at lower end-customer demand variances.

[1]  David Frederick Ross Supply Chain Inventory Management , 1998 .

[2]  Paul Glasserman,et al.  Sensitivity Analysis for Base-Stock Levels in Multiechelon Production-Inventory Systems , 1995 .

[3]  Paul H. Zipkin,et al.  Competitive and Cooperative Inventory Policies in a Two-Stage Supply Chain , 1999 .

[4]  Paul Glasserman,et al.  Gradient Estimation Via Perturbation Analysis , 1990 .

[5]  Awi Federgruen,et al.  Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy , 1991, Oper. Res..

[6]  Sridhar R. Tayur,et al.  A Capacitated Production-Inventory Model with Periodic Demand , 1998, Oper. Res..

[7]  M. Reiman,et al.  Echelon Reorder Points, Installation Reorder Points, and the Value of Centralized Demand Information , 1998 .

[8]  R. Kapuściński,et al.  Value of Information in Capacitated Supply Chains , 1999 .

[9]  S. Tayur Computing the Optimal Policy for Capacitated Inventory Models , 1993 .

[10]  Paul Glasserman,et al.  The Stability of a Capacitated, Multi-Echelon Production-Inventory System Under a Base-Stock Policy , 1994, Oper. Res..

[11]  Srinagesh Gavirneni,et al.  Managing a Customer Following a Target Reverting Policy , 1999, Manuf. Serv. Oper. Manag..

[12]  Marshall L. Fisher,et al.  Supply Chain Inventory Management and the Value of Shared Information , 2000 .

[13]  Dimitri P. Bertsekas,et al.  Dynamic Programming: Deterministic and Stochastic Models , 1987 .

[14]  H. Scarf THE OPTIMALITY OF (S,S) POLICIES IN THE DYNAMIC INVENTORY PROBLEM , 1959 .

[15]  Awi Federgruen,et al.  An Inventory Model with Limited Production Capacity and Uncertain Demands II. The Discounted-Cost Criterion , 1986, Math. Oper. Res..