Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations

References

• Arnold L. Stochastic Differential Equations: Theory and Applications (1992) (Krieger Publishing Company, Malabar, FL) Google Scholar
• Billingsley P. Convergence of Probability Measures (1999) (John Wiley & Sons, Hoboken, NJ) Crossref, Google Scholar
• Ethier SN, Kurtz TG. Markov Processes: Characterization and Convergence (1986) 1st ed.(John Wiley & Sons, Hoboken, NJ) Crossref, Google Scholar
• Folland GB. Real Analysis: Modern Techniques and Their Applications (1999) 2nd ed.(John Wiley & Sons, Hoboken, NJ) Google Scholar
• Garnet O, Mandelbaum A, Reiman MI. Designing a call center with impatient customers. Manufacturing Service Oper. Management (2002) 4(3):208–227Link, Google Scholar
• Halfin S, Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29(3):567–588Link, Google Scholar
• Hampshire RC, Jennings OB, Massey WA. A time-varying call center design via Lagrangian mechanics. Probab. Engrg. Inform. Sci. (2009) 23(2):231–259Crossref, Google Scholar
• Kurtz TG. Strong approximation theorems for density dependent Markov chains. Stochastic Processes and Their Appl. (1978) 6(3):223–240Crossref, Google Scholar
• Mandelbaum A, Pats G. State-dependent queues: Approximations and applications. Institute for Math. Its Appl. (1995) 71:239–282Google Scholar
• Mandelbaum A, Pats G. State-dependent stochastic networks. Part I: Approximations and applications with continuous diffusion limits. Ann. Appl. Probab. (1998) 8(2):569–646Crossref, Google Scholar
• Mandelbaum A, Zeltyn S. Staffing many-server queues with impatient customers: Constraint satisfaction in call centers. Oper. Res. (2009) 57(5):1189–1205Link, Google Scholar
• Mandelbaum A, Massey WA, Reiman MI. Strong approximations for Markovian service networks. Queueing Systems (1998) 30(1-2):149–201Crossref, Google Scholar
• Mandelbaum A, Massey WA, Reiman MI, Stolyar A, Rider B. Queue lengths and waiting times for multiserver queues with abandonment and retrials. Telecomm. Systems (2002) 21(2-4):149–171Crossref, Google Scholar
• Massey WA, Whitt W. Uniform acceleration expansions for Markov chains with time-varying rates. Ann. Appl. Probab. (1998) 8(4):1130–1155Crossref, Google Scholar
• Pang G, Whitt W. Heavy-traffic limits for many-server queues with service interruptions. Queueing Systems (2009) 61(2-3):167–202Crossref, Google Scholar
• Puhalskii AA, Reiman MI. The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. Appl. Probab. (2000) 32(2):564–595Crossref, Google Scholar
• Whitt W. Stochastic Process Limits (2002) 1st ed.(Springer-Verlag, New York) Crossref, Google Scholar
• Whitt W. Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. (2006a) 50(10):1449–1461Link, Google Scholar
• Whitt W. Fluid models for multiserver queues with abandonments. Oper. Res. (2006b) 54(1):37–54Link, Google Scholar
• Zeltyn S, Mandelbaum A. Call centers with impatient customers: Many-server asymptotics of the M/M/n + G queue. Queueing Systems (2005) 51(3-4):361–402Crossref, Google Scholar