Dimensioning Large-Scale Membership Services

References

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