Inventories with Multiple Supply Sources and Networks of Queues with Overflow Bypasses

Published Online:https://doi.org/10.1287/mnsc.1080.0941

References

  • Baskett F., Chandy M., Nuntz R., Palocios J. Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. (1975) 22:248–260CrossrefGoogle Scholar
  • Boucherie R., Heidevelt B., van Houtum G. A product-form solution for two-echelon spare parts networks with emergency shipments. (2007) . Working paper, Technische Universiteit Eindhoven, Eindhoven, The NetherlandsGoogle Scholar
  • Chao X., Miyazawa M., Pinedo M.Queueing Networks: Customers, Signals and Product Form Solutions (1999) (Wiley, New York) Google Scholar
  • Chen H., Yao D.Fundamentals of Queueing Networks (2001) (Springer, New York) CrossrefGoogle Scholar
  • Dekker R., Hill R., Kleijn M., Teunter R. On the (S−1, S) lost sales inventory model with priority demand classes. Naval Res. Logist. (2002) 49:593–610CrossrefGoogle Scholar
  • de Véricourt F., Karaesmen F., Dallery Y. Optimal stock allocation for a capacitated supply system. Management Sci. (2002) 48:1486–1501LinkGoogle Scholar
  • Economou A., Fakinos D. Product form stationary distributions for queueing networks with blocking and rerouting. Queueing Systems (1998) 30:251–260CrossrefGoogle Scholar
  • Feng Q., Sethi S., Yan H., Zhang H. Are base-stock policies optimal in inventory problems with multiple delivery modes? Oper. Res. (2006) 54:801–807LinkGoogle Scholar
  • Fukuda Y. Optimal policies for the inventory problem with negotiable leadtime. Management Sci. (1964) 10:690–708LinkGoogle Scholar
  • Gallego G., Jin Y., Muriel A., Zhang G., Yildiz V. Optimal ordering policies with convertible lead times. Eur. J. Oper. Res. (2007) 176:892–910CrossrefGoogle Scholar
  • Groenevelt H., Rudi N. A base stock inventory model with possibility of rushing part of order. (2003) . Working paper, University of Rochester, Rochester, NYGoogle Scholar
  • Ha A. Inventory rationing in a make-to-stock production system with several demand classes and lost sales. Management Sci. (1997) 43:1093–1103LinkGoogle Scholar
  • Hopp W., Yin Z. Protecting supply chain networks against catastrophic failures. (2007) . Working paper, Northwestern University, Evanston, ILGoogle Scholar
  • Huggins E., Olsen T. Inventory control with generalized expediting. (2006) . Working paper, Washington University, St. LouisGoogle Scholar
  • Jackson J. Jobshop-like queueing systems. Management Sci. (1963) 10:131–142LinkGoogle Scholar
  • Kouvelis P., Tang S. On optimal expediting policy for supply systems with uncertain leadtimes. (2007) . Working paper, Washington University, St. LouisGoogle Scholar
  • Kranenburg A., van Houtum G. Cost optimization in the (S−1, S) lost sales inventory model with multiple demand classes. Oper. Res. Lett. (2007) 35:493–502CrossrefGoogle Scholar
  • Lam S. Queuing networks with population size constraints. IBM J. Res. Devel. (1977) 21:370–378CrossrefGoogle Scholar
  • Minner S. Multiple-supplier inventory models in supply chain management: A review. Int. J. Production Econom. (2003) 81–82:265–279CrossrefGoogle Scholar
  • Moinzadeh K., Schmidt C. An (S−1, S) inventory system with emergency orders. Oper. Res. (1991) 39:308–321LinkGoogle Scholar
  • Muharremoglu A., Yang N. Inventory management with an exogenous supply process. (2007) . Working paper, Columbia University, New YorkGoogle Scholar
  • Neuts M.Matrix-Geometric Solutions in Stochastic Models (1981) (Johns Hopkins, Baltimore) Google Scholar
  • Scheller-Wolf A., Veeraraghavan S., van Houtum G. Effective dual sourcing with a single-index policy. (2007) . Working paper, Carnegie-Mellon University, PittsburghGoogle Scholar
  • Serfozo R.Introduction to Stochastic Networks (1999) (Springer, New York) CrossrefGoogle Scholar
  • Sethi S., Yan H., Zhang H. Peeling layers of an onion: Inventory model with multiple delivery modes and forecast updates. J. Optim. Theory Appl. (2001) 108:253–281CrossrefGoogle Scholar
  • Sethi S., Yan H., Zhang H. Inventory models with fixed costs, forecast updates, and two delivery modes. Oper. Res. (2003) 51:321–328LinkGoogle Scholar
  • Shaked M., Shanthikumar J. G.Stochastic Orders and Their Applications (1994) (Springer, New York) Google Scholar
  • Shanthikumar G., Yao D. Second-order stochastic properties in queuing systems. Proc. IEEE (1989) 77:162–170CrossrefGoogle Scholar
  • Sheffi Y.The Resilient Enterprise (2005) (MIT Press, Cambridge, MA) Google Scholar
  • Song J., Zipkin P. Evaluation of base-stock policies in multiechelon inventory systems with state-dependent demands, Part I: State-independent policies. Naval Res. Logist. (1992) 39:715–728CrossrefGoogle Scholar
  • Song J., Zipkin P. Inventory control with information about supply conditions. Management Sci. (1996) 42:1409–1419LinkGoogle Scholar
  • Svoronos A., Zipkin P. Evaluation of one-for-one replenishment policies for multiechelon inventory systems. Management Sci. (1991) 37:68–83LinkGoogle Scholar
  • Tomlin B. On the value of mitigation and contingency strategies for managing supply-chain disruption risks. Management Sci. (2006) 52:639–657LinkGoogle Scholar
  • Tomlin B., Wang Y. On the value of mix flexibility and dual sourcing in unreliable newsvendor networks. Manufacturing Service Oper. Management (2005) 7:37–57LinkGoogle Scholar
  • van Dijk N.Queueing Networks and Product Forms (1993) (Wiley, New York) Google Scholar
  • Veeraraghavan S., Scheller-Wolf A. Now or later: A simple policy for effective dual sourcing in capacitated systems. Oper. Res. (2008) 56:850–864LinkGoogle Scholar
  • Whittmore A., Saunders S. Optimal inventory under stochastic demand with two supply options. SIAM J. Appl. Math. (1977) 32:293–305CrossrefGoogle Scholar
  • Zipkin P. Stochastic leadtimes in continuous-time inventory models. Naval Res. Logist. (1986) 33:763–774CrossrefGoogle 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.