Algorithms for Time-Varying Networks of Many-Server Fluid Queues

Published Online:https://doi.org/10.1287/ijoc.1120.0547

References

  • Brown L, Gans N, Mandelbaum A, Sakov A, Shen H, Zeltyn S, Zhao L (2005) Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. 100(469):36–50.CrossrefGoogle Scholar
  • Green LV, Kolesar PJ, Whitt W (2007) Coping with time-varying demand when setting staffing requirements for a service system. Production Oper. Management 16(1):13–39.CrossrefGoogle Scholar
  • Kang W, Pang G (2011) Computation and properties of fluid models for time-varying many-server queues with abandonment. Working paper, Pennsylvania State University, University Park.Google Scholar
  • Liu Y, Whitt W (2011a) A network of time-varying many-server fluid queues with customer abandonment. Oper. Res. 59(4):835–846.LinkGoogle Scholar
  • Liu Y, Whitt W (2011b) Large-time asymptotics for the Gt/Mt/st + GIt many-server fluid queue with abandonment. Queueing Systems 67(2):145–182.CrossrefGoogle Scholar
  • Liu Y, Whitt W (2012a) The Gt/GI/st + GI many-server fluid queue. Queueing Systems 71(4):405–444.CrossrefGoogle Scholar
  • Liu Y, Whitt W (2012b) A many-server fluid limit for the Gt/GI/st + GI queueing model experiencing periods of overloading. Oper. Res. Lett. 40(5):307–312.CrossrefGoogle Scholar
  • Liu Y, Whitt W (2013) Many-server heavy-traffic limits for queues with time-varying parameters. Ann. Appl. Probab. Forthcoming.Google Scholar
  • Mandelbaum A, Massey WA, Reiman MI (1998) Strong approximations for Markovian service networks. Queueing Systems 30(1–2):149–201.CrossrefGoogle Scholar
  • Mandelbaum A, Massey WA, Reiman MI, Rider B (1999a) Time varying multiserver queues with abandonments and retrials. Key P, Smith D, eds. Proc. 16th Internat. Teletraffic Congress, Edinburgh, UK, 355–364.Google Scholar
  • Mandelbaum A, Massey WA, Reiman MI, Stolyar A (1999b) Waiting time asymptotics for time varying multiserver queues with abandonment and retrials. Proc. of 37th Annual Allerton Conf. Comm., Control Comput., Allerton, IL, 1095–1104.Google Scholar
  • Massey WA, Whitt W (1993) Networks of infinite-server queues with nonstationary Poisson input. Queueing Systems 13(1–3):183–250.CrossrefGoogle Scholar
  • Nelson BL, Taaffe MR (2004a) The Pht/Pht/∞ queueing system: Part I—The single node. INFORMS J. Comput. 16(3):266–274.LinkGoogle Scholar
  • Nelson BL, Taaffe MR (2004b) The [Pht/Pht/∞]k queueing system: Part II—The multiclass network. INFORMS J. Comput. 16(3):275–283.LinkGoogle Scholar
  • Newell GF (1982) Applications of Queueing Theory, 2nd ed. (Chapman and Hall, London).CrossrefGoogle Scholar
  • Thomas JW (1995) Numerical Partial Differential Equations: Finite Difference Methods (Springer, New York).CrossrefGoogle Scholar
  • Whitt W (2006) Fluid models for multiserver queues with abandonments. Oper. Res. 54(1):37–54.LinkGoogle 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.