Pointwise Stationary Fluid Models for Stochastic Processing Networks

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

References

  • Armony M., Maglaras C. On customer contact centers with a call-back option: Customer decisions, routing rules, and system design. Oper. Res. (2004) 52:271–292LinkGoogle Scholar
  • Armony M., Shimkin N., Whitt W. The impact of delay announcements in many-server queues with abandonment. (2005) . Working paper, Stern School of Business, New York University, New YorkGoogle Scholar
  • Bassamboo A., Zeevi A. On a data-driven method for staffing telephone call centers. Oper. Res. (2006) . ForthcomingGoogle Scholar
  • Bassamboo A., Harrison J. M., Zeevi A. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. (2006a) 54:419–435LinkGoogle Scholar
  • Bassamboo A., Harrison J. M., Zeevi A. Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid-limits. Queueing System Theory Appl. (2006b) 51:249–285CrossrefGoogle Scholar
  • Bremaud P.Point Processes and Queues: Martingale Dynamics (1981) (Springer Verlag, New York) CrossrefGoogle Scholar
  • Cheney W.Analysis for Applied Mathematics (2001) (Springer, New York) CrossrefGoogle Scholar
  • de Véricourt F., Zhou Y.-P. Managing response time in a call-routing problem with service failure. Oper. Res. (2005) 53:968–981LinkGoogle Scholar
  • Green L., Kolesar P. The pointwise stationary approximation for queues with nonstationary arrivals. Management Sci. (1991) 37:84–97LinkGoogle Scholar
  • Green L. V., Kolesar P. J., Whitt W. Coping with time-varying demand when setting staffing requirements for a service system. Production Oper. Management J. (2007) 16(1):13–39CrossrefGoogle Scholar
  • Harrison J. M., Suhov Y. Stochastic networks and activity analysis. Analytic Methods in Applied Probability in Memory of Fridrih Karpelevich (2002) (American Mathematical Society, Providence, RI) 53–76CrossrefGoogle Scholar
  • Harrison J. M. A broader view of Brownian networks. Annals Appl. Probability (2003) 13:1119–1150CrossrefGoogle Scholar
  • Harrison J. M., Zeevi A. A method for staffing large call centers based on stochastic fluid models. Manufacturing Service Oper. Management (2005) 7:20–36LinkGoogle Scholar
  • Maglaras C., Zeevi A. Pricing and design of differentiated services: Approximate analysis and structural insights. Oper. Res. (2005) 53:242–262LinkGoogle Scholar
  • Mandelbaum A., Massey W. A., Reiman M. Strong approximations for Markovian service networks. Queuing System Theory Appl. (1998) 30:149–201CrossrefGoogle Scholar
  • Massey W. A., Whitt W. Uniform acceleration expansions for Markov chains with time-varying rates. Annals Appl. Probability (1998) 8:1130–1155CrossrefGoogle Scholar
  • Sundaram R. K.A First Course in Optimization Theory (1996) (Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Wein L. M. Brownian networks with discretionary routing. Oper. Res. (1991) 39:322–340LinkGoogle Scholar
  • Whitt W. The pointwise stationary approximation for Mt/Mt/s queues is asymptotically correct as the rates increase. Management Sci. (1991) 37:307–314LinkGoogle Scholar
  • Whitt W. Improving service by informing customers about anticipated delays. Management Sci. (1999) 45:192–207LinkGoogle Scholar
  • Whitt W. Fluid models for many-server queues with abandonments. Oper. Res. (2006) 54:37–54LinkGoogle 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.