Dimensioning large-scale membership services

Operations Research

Volumn 56, Issue 1, 2008, Pages 173-187

  De Véricourt, Francis ^a   Jennings, Otis B ^b  

^a EUROPEAN SCHOOL OF MANAGEMENT AND TECHNOLOGY   (Germany)

^b DUKE UNIVERSITY   (United States)

Author keywords

Limit theorems; Queues: diffusion models; Service operations; Staffing; Stochastic model applications

Indexed keywords

LIMIT THEOREMS; SERVICE OPERATIONS; STAFFING;

CUSTOMER SATISFACTION; STOCHASTIC MODELS; THEOREM PROVING;

OPERATIONS RESEARCH;

EID: 41549113729     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0464     Document Type: Article

References (36)

1. Armony, M. 2005. Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems 51(3-4) 287-329.
2. Armony, M., C. Maglaras. 2004a. Contact centers with, a call-back option and real-time delay information. Oper. Res. 52(4) 527-545.
3. Armony, M., C. Maglaras. 2004b. On customer contact centers with a call-back option: Customer decisions, sequencing rules, and system, design. Oper: Res. 52(2) 271-292.
4. Atar, R. 2005. A diffusion model of scheduling control in queueing systems with, many servers. Ann. Appl. Probab. 15(1) 820-852.
5. Atar, R., A. Mandelbaum, M. Reiman. 2001. A Brownian control problem for a simple queueing system in the Halfin-Whitt regime. Working paper, Technion - Israel Institute of Technology, Haifa, Israel.
6. Atar, R., A. Mandelbaum, M. Reiman. 2004. Scheduling a multi-class queue with many iid servers: Asymptotic optimality in heavy-traffic. Ann. Appl. Probab. 14(3) 1084-1134.
7. Bassamboo, A., J. M. Harrison, A. Zeevi. 2006. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. 54 419-435.
8. Borst, S., A. Mandelbaum, M. Reiman. 2004. Dimensioning large call centers. Oper. Res. 52(1) 17-34.
9. Browne, S., W. Whitt. 1995. Piecewise-linear diffusion processes. J. Dshalalow, ed. Advances in Queueing: Theory, Methods, and Open Problems. CRC Press, Boca Raton, FL, 463-480.
10. Buzacott, J. A., J. G. Shanthikumar. 1993. Stochastic Models of Manufacturing Systems. Prentice-Hall, Englewood Cliffs, NJ.
11. de Véricourt, F., O. B. Jennings. 2006. Nurse-to-patient ratio: A queueing perspective. Working paper, Duke University, Durham, NC.
12. de Véricourt, F., Y-P. Zhou. 2005. Managing response time in a call-routing problem with service failure. Oper. Res. 53(6) 968-981.
13. Gans, N., G. Kode, A. Mandelbaum. 2003. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5 79-141.
14. Garnett, O., A. Mandelbaum, M. Reiman. 2002. Designing a call center with, impatient customers. Manufacturing Service Oper. Management 4 208-227.
15. Gurvich, I., M. Armony, A. Mandelbaum. 2005. Staffing and control of large-scale service systems with multiple customer classes and fully flexible servers. Working paper, New York University.
16. Halfin, S., W. Whitt. 1981. Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29 567-588.
17. Harrison, J. M., R. Williams. 1996. A multiclass closed queueing network with, unconventional heavy traffic behavior. Ann. Appl. Probab. 6(1) 1-47.
18. Harrison, J. M., A. Zeevi. 2004. Dynamic scheduling of a multiclass queue in the Halfin and Whitt heavy traffic regime. Oper. Res. 52(2) 243-257.
19. Harrison, J. M., A. Zeevi. 2005. A mediod for staffing large call centers using stochastic fluid models. Manufacturing Service Oper. Management 7 20-36.
20. Iglehart, D. L. 1965. Limit diffusion approximations for the many server queue and the repairman problem. J. Appl. Probab. 2 429-441.
21. Kleinrock, L. 1975. Queuing Systems, Vols. 1 & 2. John Wiley and Sons, New York.
22. Kogan, Y. A., R. S. Lipster, A. V. Smorodinskii. 1986. Gaussian diffusion approximation of closed Markov models of computer networks. Problems Inform. Tmnsmission 22 38-51.
23. Krichagina, E. V., A. A. Puhalskii. 1997. A heavy-traffic analysis of a closed queueing system, widi a GI/∞ service center. Queuing Systems: Theory Appl. 25 235-280.
24. Kumar, S. 2000. Two-server closed networks in heavy traffic: Diffusion limits and asymptotic optimality. Ann. Appl. Probab. 10(3) 930-961.
25. 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.
26. Mandelbaum, A. 2004. Call centers (centres): Research bibliography with abstracts. Working paper, Technion - Israel Institute of Technology, Haifa, Israel.
27. Mandelbaum, A., G. Pats. 1995. State-dependent queues: Approximations and applications. F. P. Kelly, R. J. Williams, eds. Stochastic Networks, IMA Volumes in Mathematics. Springer, New York.
28. Mandelbaum, A., W. A. Massey, M. I. Reiman. 1998. Strong approximations for Markovian service networks. Queueing Systems: Theory Appl. 30(1-2) 149-201.
29. Milner, J. M., T. L. Olsen. 2004. Service level agreements in call centers: Perils and prescriptions. Working paper, Washington University, St. Louis, MO.
30. Puhalskii, A. 1994. On the invariance principle for the first passage time. Math. Oper. Res. 19(4) 946-954.
31. Randhawa, R. S., S. Kumar. 2005. Operational benefits of subscription services. Working paper, Stanford University, Stanford, CA.
32. Stone, C. J. 1963. Limit theorems for random walks, birth and death processes and diffusion processes. Illinois J. Math. 4 638-660.
33. Whitt, W. 1992. Understanding the efficiency of multi-server service systems. Management Sci. 38(5) 708-723.
34. Whitt, W. 2002. Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Applications. Springer, New York.
35. Whitt, W. 2004. Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. 50(10) 1449-1461.
36. Whitt, W. 2005. Engineering solution, of a basic call-center model. Management Sci. 51(2) 221-235.