Single-Stage Approximations for Optimal Policies in Serial Inventory Systems with Nonstationary Demand

Published Online:https://doi.org/10.1287/msom.1110.0373

References

  • Abhyankar S., Graves S. Creating an inventory hedge for Markov-modulated Poisson demand: An application and a model. Manufacturing Service Oper. Management (2001) 3(4):306–320LinkGoogle Scholar
  • Cachon G., Zipkin P. Competitive and cooperative inventory policies in a two-stage supply chain. Management Sci. (1999) 45(3):936–953LinkGoogle Scholar
  • Chao X., Zhou S. Probabilistic solution and bounds for serial inventory system with discounted and average cost. Naval Res. Logist. (2007) 54(6):623–631CrossrefGoogle Scholar
  • Chen F. Decentralized supply chains subject to information delays. Management Sci. (1999) 45(8):1076–1090LinkGoogle Scholar
  • Chen F., Song J.-S. Optimal policies for multiechelon problems with Markov-modulated demand. Oper. Res. (2000) 49(2):226–234LinkGoogle Scholar
  • Chen F., Zheng Y.-S. Lower bounds for multi-echelon stochastic inventory systems. Management Sci. (1994) 40(11):1426–1443LinkGoogle Scholar
  • Clark A., Scarf H. Optimal policies for a multi-echelon inventory problem. Management Sci. (1960) 6(4):475–490LinkGoogle Scholar
  • Dong L., Lee H. Optimal policies and approximations for a serial multi-echelon inventory system with time-correlated demand. Oper. Res. (2003) 51(6):969–980LinkGoogle Scholar
  • Donohue K. Efficient supply contracts for fashion goods with forecast updating and two production modes. Management Sci. (2000) 46(11):1397–1411LinkGoogle Scholar
  • Erkip N., Hausman W., Nahmias S. Optimal centralized ordering policies in multi-echelon inventory systems with correlated demands. Management Sci. (1990) 36(3):381–392LinkGoogle Scholar
  • Ettl M., Feigin G., Lin G., Yao D. A supply network model with base-stock control and service requirements. Oper. Res. (2000) 48(2):216–232LinkGoogle Scholar
  • Federgruen A., Zipkin P. Computational issues in an infinite horizon multi-echelon inventory problem with stochastic demand. Oper. Res. (1984) 32(4):818–836LinkGoogle Scholar
  • Gallego G., Özer Ö. Optimal replenishment policies for multiechelon inventory problems under advance demand information. Manufacturing Service Oper. Management (2003) 5(2):157–175LinkGoogle Scholar
  • Gallego G., Özer Ö. A new algorithm and a new heuristic for serial supply systems. Oper. Res. Lett. (2005) 33(4):349–362CrossrefGoogle Scholar
  • Graves S., Willems S. Optimizing strategic safety stock placement in supply chains. Manufacturing Service Oper. Management (2000) 2(1):68–83LinkGoogle Scholar
  • Graves S., Willems S. Strategic inventory placement in supply chains: Nonstationary demand. Manufacturing Service Oper. Management (2008) 10(2):278–287LinkGoogle Scholar
  • Lee H., Whang S. Decentralized multi-echelon supply chains: Incentives and information. Management Sci. (1999) 45(5):633–640LinkGoogle Scholar
  • Muharremoglu A., Tsitsiklis J. A single-unit decomposition approach to multiechelon inventory systems. Oper. Res. (2008) 56(5):1089–1103LinkGoogle Scholar
  • Parker R. P., Kapuscinski R. Managing a noncooperative supply chain with limited capacity. Oper. Res. (2011) 59(4):866–881LinkGoogle Scholar
  • Rosling K. Optimal inventory policies for assembly systems under random demands. Oper. Res. (1989) 37(4):565–579LinkGoogle Scholar
  • Schoenmeyr T., Graves S. Strategic safety stocks in supply chains with evolving forecasts. Manufacturing Service Oper. Management (2009) 11(4):657–673LinkGoogle Scholar
  • Shang K., Song J.-S. Newsvendor bounds and heuristic for optimal policies in serial supply chains. Management Sci. (2003) 49(5):618–638LinkGoogle Scholar
  • Shang K., Song J.-S., Zipkin P. Coordination mechanisms in decentralized serial inventory systems with batch ordering. Management Sci. (2009) 55(4):685–695LinkGoogle Scholar
  • Zipkin P.Foundations of Inventory Management (2000) (McGraw-Hill, New York) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.