Hostname: page-component-89b8bd64d-5bvrz Total loading time: 0 Render date: 2026-05-06T20:18:11.185Z Has data issue: false hasContentIssue false
  • English
  • Français

THE VALUE OF INFORMATION SHARING IN A TWO-STAGE SUPPLY CHAIN WITH PRODUCTION CAPACITY CONSTRAINTS: THE INFINITE HORIZON CASE

Published online by Cambridge University Press:  16 April 2004

David Simchi-Levi  and
Yao Zhao
David Simchi-Levi
Affiliation:
The Engineering Systems Division and the, Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, E-mail: dslevi@mit.edu
Yao Zhao
Affiliation:
Department of Management Science and Information Systems, Rutgers University, Newark, New Jersey 07102-1895, E-mail: yaozhao@andromeda.rutgers.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

We study the value of information sharing in a two-stage supply chain with a single manufacturer and a single retailer in an infinite time horizon, where the manufacturer has finite production capacity and the retailer faces independent demand. The manufacturer receives demand information even during periods of time in which the retailer does not order. Allowing for time-varying cost functions, our objective is to characterize the impact of information sharing on the manufacturer's cost and service level. We develop a new approach to characterize the induced Markov chains under cyclic order-up-to policy and provide a simple proof for the optimality of cyclic order-up-to policy for the manufacturer under the average cost criterion. Using extensive computational analysis, we quantify the impact of information sharing on the manufacturer's performance in an infinite time horizon under both i.i.d. demand and independent but nonstationary demand.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 18 , Issue 2 , April 2004 , pp. 247 - 274
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

Research supported in part by ONR contracts N00014-95-1-0232 and N00014-01-1-0146 and NSF contracts DMI-9732795, DMI-0085683, and DMI-0245352.

References

REFERENCES

Aviv, Y. & Federgruen, A. (1997). Stochastic inventory models with limited production capacities and periodically varying parameters. Probability in the Engineering and Informational Sciences 11: 107–135.Google Scholar
Aviv, Y. & Federgruen, A. (1998). The operational benefits of information sharing and vendor managed inventory (VMI) programs. Working Paper. Washington University, St. Louis.
Cachon, G.P. & Fisher, M. (2000). Supply chain inventory management and the value of shared information. Management Science 46: 1032–1050.Google Scholar
Chen, F. (1998). Echelon reorder points, installation reorder points, and the value of centralized demand information. Management Science 44: 221–234.Google Scholar
Chen, F., Drezner, I., Ryan, J.K., & Simchi-Levi, D. (2000). Quantifying the bullwhip effect in a simple supply chain: The impact of forecasting, lead time, and information. Management Science 46: 436–443.Google Scholar
Federgruen, A., Schweitzer, P., & Tijms, H. (1983). Denumerable undiscounted decision processes with unbounded rewards. Mathematics of Operations Research 8: 298–314.Google Scholar
Federgruen, A. & Zipkin, P. (1986). An inventory model with limited production capacity and uncertain demands 1: The average-cost criterion. Mathematics of Operations Research 11: 193–207.Google Scholar
Federgruen, A. & Zipkin, P. (1986). An inventory model with limited production capacity and uncertain demands 2: The discounted-cost criterion. Mathematics of Operations Research 11: 208–215.Google Scholar
Fu, M.C. (1994). Optimization via simulation: A review. Annals of Operations Research 53: 199–247.Google Scholar
Gallego, G. & Ozer, O. (2001). Integrating replenishment decisions with advanced demand information. Management Science 47: 1344–1360.Google Scholar
Gavirneni, S., Kapuscinski, R., & Tayur, S. (1999). Value of information in capacitated supply chains. Management Science 45: 16–24.Google Scholar
Glasserman, P. & Tayur, S. (1995). Sensitivity analysis for base-stock levels in multiechelon production-inventory systems. Management Science 41: 263–281.Google Scholar
Hariharan, R. & Zipkin, P. (1995). Customer-order information, lead times, and inventories. Management Science 41: 1599–1607.Google Scholar
Heyman, D. & Sobel, M. (1984). Stochastic models in operations research, Vol. 2. New York: McGraw-Hill.
Kapuscinski, R. & Tayur, S. (1995). A capacitated production–inventory model with periodic demand. GSIA Working Paper. Carnegie Mellon University, Pittsburgh, PA.
Kapuscinski, R. & Tayur, S. (1998). A capacitated production-inventory model with periodic demand. Operations Research 46: 899–911.Google Scholar
Karlin, S. (1960). Dynamic inventory policy with varying stochastic demands. Management Science 6: 231–258.Google Scholar
Karr, A.F. (1993). Probability. New York: Springer-Verlag.
Kemeny, J.G., Snell, J.L., & Knapp, A.W. (1966). Denumerable Markov chains. New York: D. Van Nostrand.
Kulkarni, V.G. (1995). Modeling and analysis of stochastic systems. New York: Chapman & Hall.
Lee, H., Padmanabhan, P., & Whang, S. (1997). Information distortion in a supply chain: The Bullwhip effect. Management Science 43: 546–558.Google Scholar
Lee, H., So, K.C., & Tang, C.S. (2000). The value of information sharing in a two-level supply chain. Management Science 46: 626–643.Google Scholar
Meyn, S.P. & Tweedie, R.L. (1993). Markov chains and stochastic stability. London: Springer-Verlag.
Puterman, M.L. (1994). Markov decision processes: Discrete stochastic dynamic programming. New York: Wiley.
Sennott, L.I. (1989). Average cost optimal stationary policies in infinite state Markov decision processes with unbounded costs. Operations Research 37: 261–272.Google Scholar
Sennott, L.I. (1999). Stochastic dynamic programming and the control of queuing systems. New York: Wiley.
Sethi, S.P. & Cheng, F. (1997). Optimality of (s,S) policies in inventory models with Markovian demand. Operations Research 45: 931–939.Google Scholar
Simchi-Levi, D. & Zhao, Y. (to appear). The value of information sharing in a two-stage supply chain with production capacity constraints. Naval Research Logistics; available upon request from yaozhao@andromeda.rutgers.edu.
Simchi-Levi, D. & Zhao, Y. (2001). The value of information sharing in a two-stage supply chain with production capacity constraints: The infinite horizon case. Working Paper. Rutgers University, Newark, NJ; available upon request from yaozhao@andromeda.rutgers.edu.
Song, J.S. & Zipkin, P. (1993). Inventory control in a fluctuating environment. Operations Research 41: 351–370.Google Scholar
Stein, T. & Sweat, J. (1998). Killer supply chains. Information Week. Obtained at www.informationweek.com/708/08iukil.htm.
Zipkin, P. (1989). Critical number policies for inventory models with periodic data. Management Science 35: 71–80.Google Scholar