Service-Level Agreements in Call Centers: Perils and Prescriptions

References

• Akşin O. Z., de Véricourt F., Karaesmen F. Call center outsourcing contract analysis and choice. Management Sci. (2008) 54(2):354–368Link, Google Scholar
• Application Service Provider Industry Consortium An over- view of the guide to service level agreements. (2000) . White paper. http://whitepapers.zdnet.co.uk/0,1000000651,260094626p,00.htmGoogle Scholar
• Armony M. Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems (2005) 51:287–329Crossref, Google Scholar
• Armony M., Haviv M. Price and delay competition between two service providers. Eur. J. Oper. Res. (2003) 147(1):32–50Crossref, 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, routing 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. (2005a) 15(1B):820–852Crossref, Google Scholar
• Atar R. Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. (2005b) 15(4):2606–2650Crossref, Google Scholar
• Atar R., Mandelbaum A., Reiman M. I. A Brownian control problem for a simple queueing system in the Halfin-Whitt regime. Systems Control Lett. (2004a) 51:269–275Crossref, Google Scholar
• Atar R., Mandelbaum A., Reiman M. I. Scheduling a multi-class queue with many exponential servers: Asymptotic optimality in heavy-traffic. Ann. Appl. Probab. (2004b) 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(3):419–435Link, Google Scholar
• Bhulai S., Koole G. A queueing model for call blending in call centers. IEEE Trans. Automatic Control (2003) 48(8):1434–1438Crossref, Google Scholar
• Boyle K., Tochner J. Customizing service level agreements in call center outsourcing yields better results. Outsourcing J. (2004) February). http://www.outsourcing-journal.com/index.htmlGoogle Scholar
• Bramson M. State-space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems (1998) 30:89–148Crossref, Google Scholar
• Cross R., Liedtka J., Weiss L. A practical guide to social networks. Harvard Bus. Rev. (2005) 83(3):1–9Google Scholar
• Dai J. G., Tezcan T. State space collapse in many server diffusion limits of parallel server systems. (2005) . Working paper, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
• Gans N., Zhou Y.-P. A call-routing problem with service-level constraints. Oper. Res. (2003) 51(2):255–271Link, Google 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
• Global Call Center Outsourcing Summit The Westin St. Louis, St. Louis, MO. (2004) . http://www.tmcnet.com/gccosGoogle Scholar
• Glynn P. W., Heyman D. P., Sobel M. J. Diffusion approximations. Stochastic Models (1990) (Elsevier Science Publishers, North-Holland, Amsterdam) 145–198Crossref, Google Scholar
• Gurvich I. Design and control of the M/M/N queue with multi-type customers and many servers. (2004) . Master's thesis, Technion-Israel Institute of Technology, Haifa, IsraelGoogle Scholar
• Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29(3):567–587Link, Google Scholar
• Harrison J. M., Zeevi A. Dynamic scheduling of a multiclass queue in the Halfin and Whitt heavy traffic regime. Oper. Res. (2004) 2(2):243–257Link, Google Scholar
• Iglehart D. L., Whitt W. Multiple channel queues in heavy traffic I. Adv. Appl. Probab. (1970) 2(1):150–177Crossref, Google Scholar
• Jackson K. Thinking beyond the old 80/20 rule. Call Center Magazine (2002) 15(1):54–56Google Scholar
• Koole G. Redefining the service level in call centers. (2005) . Working paper. Vrije Universiteit Amsterdam. http://www.math.vu.nl/∼koole/articles/report03bGoogle Scholar
• Maglaras C., Van Mieghem J. A. Queueing systems with leadtime constraints: A fluid-model approach for admission and sequencing control. Eur. J. Oper. Res. (2005) 167(1):179–207Crossref, Google Scholar
• Mandelbaum A. Call centers: Research bibliography with abstracts. (2004) . Version 6, December 23. http://iew3.technion.ac.il/serveng/References/ccbib.pdfGoogle Scholar
• Mandelbaum A., Stolyar A. L. Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. (2004) 52(6):836–855Link, Google Scholar
• Mandelbaum A., Massey W. A., Reiman M. I. Strong approximations for Markovian service networks. Queueing Systems (1998) 30:149–201Crossref, Google Scholar
• Milner J. M., Olsen T. L. Service level agreements in call centers: Perils and prescriptions. (2005) . Technical report, Rotman School of Management, University of Toronto, Toronto, Ontario, CanadaGoogle Scholar
• OutsourcingBestPractices.com Ten key questions for developing effective service level agreements. (2001) . http://www.outsourcing-best-practices.com/ten.htmlGoogle Scholar
• Plambeck E., Kumar S., Harrison J. M. Asymptotic optimality of a single server queueing system with constraints on throughput times. Queueing Systems (2001) 39:23–54Crossref, Google Scholar
• Reiman M. I., Baccelli F., Fayolle G. Some diffusion approximations with state-space collapse. Modeling and Performance Evaluation Methodology. INRIA Lecture Notes in Control and Information Sciences (1984) 60(Springer, New York) 209–240Google Scholar
• Ridley A. D., Massey W., Fu M. Fluid approximation of a priority call center with time-varying arrivals. Telecomm. Rev. (2004) 69–77Google Scholar
• Saltzman R. M., Mehrotra V. A call center uses simulation to drive strategic change. Interfaces (2001) 31(3):87–101Link, Google Scholar
• Taylor C. Taylor reach group. (2005) . Personal communicationGoogle Scholar
• Van Mieghem J. A. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. (1995) 5(3):808–833Crossref, Google Scholar
• Wallace R. B., Whitt W. A staffing algorithm for call centers with skill-based routing. (2005) . Working paper, Columbia University, New YorkGoogle Scholar
• Whitt W. Weak convergence theorems for priority queues: Preemptive-resume discipline. J. Appl. Probab. (1971) 8:74–94Crossref, Google Scholar
• Whitt W. A diffusion approximation for the G/GI/n/m queue. Oper. Res. (2004) 52(6):922–941Link, Google Scholar
• Williams R. Diffusion approximations for open multiclass queuing networks: Sufficient conditions involving state-space collapse. Queueing Systems (1998) 30:27–88Crossref, Google Scholar
• Wolff R. W.Stochastic Modeling and the Theory of Queues (1989) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar