Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime

References

• Aldous D., Bandyopadhyay A. A survey of max-type recursive distributional equations. Ann. Appl. Probab. (2005) 15(2):1047–1110Crossref, Google Scholar
• Armony M., Maglaras C. Contact centers with a call-back option and real-time delay information. Oper. Res. (2004) 52(4):527–545Link, Google Scholar
• Armony M., Maglaras C. On customer contact centers with a call-back option: Customer decisions, sequencing rules, and system design. Oper. Res. (2004) 52(2):271–292Link, Google Scholar
• Asmussen S.Applied Probability and Queues (2003) 2nd ed.(Springer-Verlag, New York) Google Scholar
• Atar R. A diffusion model of scheduling control in queueing systems with many servers. Ann. Appl. Probab. (2005) 15(1B):820–852Crossref, Google Scholar
• Atar R. Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. (2005) 15(4):2606–2650Crossref, Google Scholar
• Atar R., Mandelbaum A., Reiman M. Scheduling a multi class queue with many exponential servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. (2004) 14(3):1084–1134Crossref, Google Scholar
• Baccelli F., Bremaud P.Elements of Queueing Theory (2003) 2nd ed.(Springer-Verlag, Berlin) Crossref, Google Scholar
• Borst S., Mandelbaum A., Reiman M. Dimensioning of large call centers. Oper. Res. (2004) 52(1):17–34Link, Google Scholar
• Brown L., Gans N., Mandelbaum A., Sakov A., Zeltyn S., Zhao L., Heipeng S. Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. (2005) 100:36–50Crossref, Google Scholar
• Erlang A. K., Brockmeyer E., Halstrom H. L., Jensen A. On the rational determination of the number of circuits. The Life and Works of A. K. Erlang (1948) (The Copenhagen Telephone Company, Copenhagen) Google Scholar
• Fleming P., Stolyar A., Simon B. Heavy traffic limit for a mobile phone system loss model. Proc. 2nd Int'l Conf. Telecomm. Syst. Mod. Anal. (1994) Nashville, TNGoogle Scholar
• Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management (2003) 5(2):79–141Link, Google Scholar
• Garnett O., Mandelbaum A., Reiman M. Designing a call center with impatient customers. Manufacturing Service Oper. Management (2002) 4(3):208–227Link, Google Scholar
• Glynn P., Whitt W. A new view of the heavy-traffic limit theorem for the infinite-server queue. Adv. Appl. Probab. (1991) 23:188–209Crossref, Google Scholar
• Gromoll H. C., Puha A. L., Williams R. J. The fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. (2002) 12(3):797–859Crossref, Google Scholar
• Gurvich I., Armory M., Mandelbaum A. Service level differentiation in call centers with fully flexible servers. Management Sci. (2008) 54(2):279–294Link, Google Scholar
• Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29(3):567–588Link, Google Scholar
• Harrison J. M., Zeevi A. Dynamic scheduling of a multiclass queue in the Halfin-Whitt heavy traffic regime. Oper. Res. (2004) 52(2):243–257Link, Google Scholar
• Jacod J., Shiryaev A. Limit theorems for stochastic processes. (2003) 2nd ed.(Springer-Verlag, Berlin) Crossref, Google Scholar
• Jagerman D. Some properties of the Erlang loss function. Bell System Techn. J. (1974) 53(3):525–551Crossref, Google Scholar
• Jelenković P., Mandelbaum A., Momčilović P. Heavy traffic limits for queues with many deterministic servers. Queueing Syst. Theory Appl. (2004) 47(1–2):53–69Crossref, Google Scholar
• Karatzas I., Shreve S.Brownian Motion and Stochastic Calculus (1991) 2nd ed.(Springer-Verlag, New York) Google Scholar
• Kiefer J., Wolfowitz J. On the theory of queues with many servers. Trans. Amer. Math. Soc. (1955) 78:1–18Crossref, Google Scholar
• Krichagina E., Puhalskii A. A heavy-traffic analysis of a closed queueing system with a GI/∞ service center. Queueing System Theory Appl. (1997) 25(1–4):235–280Crossref, Google Scholar
• Maglaras C., Zeevi A. Pricing and capacity sizing for systems with shared resources: Approximate solutions and scaling relations. Management Sci. (2003) 49(8):1018–1038Link, Google Scholar
• Mandelbaum A., Massey W. Strong approximations for time-dependent queues. Math. Oper. Res. (1995) 20(1):33–64Link, Google Scholar
• Mandelbaum A., Schwartz R. Simulation experiments with M/G/100 queues in the Halfin-Whitt (Q.E.D.) regime. (2002) . Technical report, Technion, http://iew3.technion.ac.il/serveng/References/references.htmlGoogle Scholar
• Mandelbaum A., Zeltyn S. Staffing many-server queues with impatient customers: Constraint satisfaction in call centers. (2006) . preprintGoogle Scholar
• Puhalskii A. On the invariance principle for the first passage time. Math. Oper. Res. (1994) 19(4):946–954Link, Google Scholar
• Puhalskii A., Reiman M. The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. Appl. Probab. (2000) 32(3):564–595Crossref, Google Scholar
• Tezcan T. Optimal control of distributed parallel server systems under the Halfin and Whitt regime. Math. Oper. Res. (2008) 33(1):51–90Link, Google Scholar
• Whitt W. Some useful functions for functional limit theorems. Math Oper. Res. (1980) 5(1):67–85Link, Google Scholar
• Whitt W.Stochastic-Process Limits (2002) (Springer, New York) Crossref, Google Scholar
• Whitt W. A diffusion approximation for the G/GI/n/m queue. Oper. Res. (2004) 52(6):922–941Link, Google Scholar
• Whitt W. Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. (2004) 50(10):1449–1461Link, Google Scholar
• Whitt W. Heavy-traffic limits for the G/H2*/n/m queue. Math. Oper. Res. (2005) 30(1):1–27Link, Google Scholar
• Zeltyn S., Mandelbaum A. Call centers with impatient customers: Many-server asymptotics of the M/M/n+G queue. Queueing Syst. Theory Appl. (2005) 51(3–4):361–402Crossref, Google Scholar