Demand Allocation in Systems with Multiple Inventory Locations and Multiple Demand Sources

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

References

  • Albin S. L. Approximating a point process by a renewal process, II: Superposition arrival processes to queues. Oper. Res. (1984) 32:1133–1162LinkGoogle Scholar
  • Bassok Y., Anupindi R., Akella R. Single-period multiproduct inventory models with substitution. Oper. Res. (1999) 47:632–642LinkGoogle Scholar
  • Bell C. E., Stidham C. Individual versus social optimization in the allocation of customers to alternative servers. Management Sci. (1983) 29:831–839LinkGoogle Scholar
  • Benjaafar S., Gupta D. Workload allocation in multi-product, multi-facility production systems with setup times. IIE Trans. (1999) 31:339–352CrossrefGoogle Scholar
  • Benjaafar S., Cooper W. L., Kim J. S. On the benefits of inventory pooling in production-inventory systems. Management Sci. (2005) 51:548–565LinkGoogle Scholar
  • Benjaafar S., ElHafsi M., de Véricourt F. Demand allocation in multiple-product, multiple-facility make-to-stock systems. Management Sci. (2004) 50:1431–1448LinkGoogle Scholar
  • Bonomi F., Kumar A. Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler. IEEE Trans. Comput. (1990) 39:1232–1250CrossrefGoogle Scholar
  • Buzacott J., Shanthikumar J.Stochastic Models of Manufacturing Systems (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Cornuéjols G., Nemhauser G. L., Wolsey L. A., Mirchandani P., Francis R. The uncapacitated facility location problem. Discrete Location Theory (1990) (John Wiley & Sons, New York) 119–171Google Scholar
  • Daskin M. S., Snyder L. V., Berger R. T., Langevin A., Riopel D. Facility location in supply chain design. Logistics Systems: Design and Operation (2005) (Springer, New York) 39–66CrossrefGoogle Scholar
  • de Véricourt F., Karaesmen F., Dallery W. Dynamic scheduling in a make-to-stock system: A partial characterization of optimal policies. Oper. Res. (2000) 48:811–819LinkGoogle Scholar
  • Eppen G. D. Effects of centralization on expected costs in a multi-location newsboy problem. Management Sci. (1979) 25:498–501LinkGoogle Scholar
  • Gerchak Y., He Q.-M. On the relation between the benefits of risk pooling and the variability of demand. IIE Trans. (2003) 35:1027–1031CrossrefGoogle Scholar
  • Gerchak Y., Henig M. Component commonality in assemble-to-order system: Models and properties. Naval Res. Logist. (1989) 36:61–68CrossrefGoogle Scholar
  • Labbé M., Louveaux F. V., Dell'Amico M., Maffioli F., Martello S. Location problems. Annotated Bibliographies in Combinatorial Optimization (1997) (Wiley, Chichester, UK) 261–281Google Scholar
  • Liu Z., Righter R. Optimal load balancing on distributed homogeneous unreliable processors. Oper. Res. (1998) 46:563–573LinkGoogle Scholar
  • Murota K.Discrete Convex Analysis (SIAM Monographs Discrete Math. Appl.) (2003) (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA) CrossrefGoogle Scholar
  • Netessine S., Dobson G., Shumsky R. A. Flexible service capacity: Optimal investment and the impact of demand correlation. Oper. Res. (2002) 50:375–388LinkGoogle Scholar
  • Ni L. M., Hwang K. Optimal load balancing in multiple processor system with many job classes. IEEE Trans. Software Engrg. (1985) SE-11:491–496CrossrefGoogle Scholar
  • Peterson W. P. A heavy traffic limit theorem for networks of queues with multiple customer types. Math. Oper. Res. (1991) 16:90–118LinkGoogle Scholar
  • Shen Z.-J. M., Coullard C. R., Daskin M. S. A joint location-inventory model. Transportation Sci. (2003) 37:40–55LinkGoogle Scholar
  • Sherali H. D., Al-Loughani I., Subramanian S. Global optimization procedures for the capacitated Euclidean and lp distance multifacility location-allocation problems. Oper. Res. (2002) 50:433–448LinkGoogle Scholar
  • Tang C. S., van Vliet M. Traffic allocation for manufacturing systems. Eur. J. Oper. Res. (1994) 75:171–185CrossrefGoogle Scholar
  • Thonemann U. W., Brandeau M. L. Optimal commonality in component design. Oper. Res. (2000) 48:1–19LinkGoogle Scholar
  • Tijms H.Stochastic Models: An Algorithmic Approach (1995) (John Wiley & Sons, New York) Google Scholar
  • van Houtum G., Adan I., van der Wal J. The symmetric longest queue system. Stochastic Models (1997) 13:105–120CrossrefGoogle Scholar
  • van Mieghem J. A., Rudi N. Newsvendor networks: Inventory management and capacity investment with discretionary activities. Manufacturing Service Oper. Management (2002) 4:313–335LinkGoogle Scholar
  • Veatch M. H., Wein L. M. Scheduling a make-to-stock queue: Index policies and hedging points. Oper. Res. (1996) 44:634–647LinkGoogle Scholar
  • Wang Y., Morris R. J. T. Load sharing in distributed systems. IEEE Trans. Comput. (1985) 34:204–217CrossrefGoogle Scholar
  • Wein L. Dynamic scheduling of a multiclass make-to-stock queue. Oper. Res. (1992) 40:724–735LinkGoogle Scholar
  • Whitt W. Approximating a point process by a renewal process, I: Two basic approaches. Oper. Res. (1982) 30:125–147LinkGoogle Scholar
  • Whitt W. The queueing network analyzer. Bell System Tech. J. (1983) 62:2779–2815CrossrefGoogle Scholar
  • Whitt W. Approximations for the GI/G/m queue. Production Oper. Management (1993) 2:114–161CrossrefGoogle Scholar
  • Wolff R. W.Stochastic Modeling and the Theory of Queues (1989) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Zheng Y.-S., Zipkin P. A queueing model to analyze the value of centralized inventory information. Oper. Res. (1990) 38:296–307LinkGoogle Scholar
  • Zipkin P. Performance analysis of a multi-item production-inventory system under alternative policies. Management Sci. (1995) 41:690–703LinkGoogle Scholar
  • Zipkin P.Foundation 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.