Queues with many servers: The virtual waiting-time process in the QED regime

Mathematics of Operations Research

Volumn 33, Issue 3, 2008, Pages 561-586

  Mandelbaum, Avishai ^a   Momčilović, Petar ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Economies of scale; Heavy traffic; Multiserver queue; Quality and efficiency driven (QED) or halfin whitt regime; Telephone call or contact centers

Indexed keywords

ECONOMIES OF SCALE; HEAVY-TRAFFIC; MULTISERVER QUEUE; QUALITY- AND EFFICIENCY-DRIVEN (QED) OR HALFIN-WHITT REGIME; TELEPHONE CALL OR CONTACT CENTERS;

ECONOMICS; SERVERS; TELEPHONE; TELEPHONE SETS;

QUEUEING THEORY;

EID: 49449103062     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1070.0310     Document Type: Article

References (38)

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