Impact of Dampening Demand Variability in a Production/Inventory System with Multiple Retailers

We study a supply chain consisting of a single manufacturer and two retailers. The manufacturer produces goods on a make-to-order basis, while both retailers maintain an inventory and use a periodic replenishment rule. As opposed to the traditional (r, S) policy, where a retailer at the end of each period orders the demand seen during the previous period, we assume that the retailers dampen their demand variability by smoothing the order size. More specifically, the order placed at the end of a period is equal to β times the demand seen during the last period plus (1 − β) times the previous order size, with β ∈ (0, 1] the smoothing parameter. We develop a GI/M/1-type Markov chain with only two nonzero blocks A 0 and A d to analyze this supply chain. The dimension of these blocks prohibits us from computing its rate matrix R in order to obtain the steady state probabilities. Instead we rely on fast numerical methods that exploit the structure of the matrices A 0 and A d , i.e., the power method, the Gauss–Seidel iteration, and GMRES, to approximate the steady state probabilities. Finally, we provide various numerical examples that indicate that the smoothing parameters can be set in such a manner that all the involved parties benefit from smoothing. We consider both homogeneous and heterogeneous settings for the smoothing parameters.

[1]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[2]  Benny Van Houdt,et al.  Performance evaluation of a production/inventory system with periodic review and endogenous lead times , 2007 .

[3]  Stephen M. Disney,et al.  Production, Manufacturing and Logistics An integrated production and inventory model to dampen upstream demand variability in the supply chain , 2006 .

[4]  Gene H. Golub,et al.  Matrix computations , 1983 .

[5]  Vaidyanathan Ramaswami,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.

[6]  C. Blondia,et al.  FS-ALOHA++, a collision resolution algorithm with QoS support for the contention channel in multiservices wireless LAN , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[7]  B. Meini,et al.  Structured Markov chains solver: software tools , 2006, SMCtools '06.

[8]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[9]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[10]  S. Steffé,et al.  Structured Markov chains solver: algorithms , 2006, SMCtools '06.

[11]  Miklós Telek,et al.  The scale factor: a new degree of freedom in phase type approximation , 2002, Proceedings International Conference on Dependable Systems and Networks.

[12]  Paulo Fernandes,et al.  Efficient descriptor-vector multiplications in stochastic automata networks , 1998, JACM.

[13]  T. Y. WilliamJ,et al.  Numerical Methods in Markov Chain Modeling , 1992, Operational Research.