Service-Level Differentiation in Call Centers with Fully Flexible Servers

References

• Armony M. Dynamic routing in large-scale service systems with heterogenous servers. Queueing Systems (2005) 51: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, routing rules, and system design. Oper. Res. (2004b) 52(2):271–292Link, Google Scholar
• Armony M., Mandelbaum A. Routing and staffing in large-scale service systems with heterogeneous servers and impatient customers. (2007) . Working paper, New York University, New YorkGoogle 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
• Bassamboo A., Harrison J. M., Zeevi A. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. (2006a) 54(3):419–435Link, Google Scholar
• Bassamboo A., Harrison J. M., Zeevi A. Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits. Queueing Systems (2006b) 51:249–285Crossref, Google Scholar
• Bell S. L., Williams R. J. Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: Asymptotic optimality of a continuous review threshold policy. Ann. Appl. Probab. (2001) 11:608–649Crossref, Google Scholar
• Bhulai S., Koole G. A queueing model for call blending in call centers. IEEE Trans. Automatic Control (2003) 48:1434–1438Crossref, Google Scholar
• Borst S., Mandelbaum A., Reiman A. M. Dimensioning large call centers. Oper. Res. (2004) 52(1):17–34Link, Google Scholar
• Cachon G. P., Lariviere M. A. Contracting to assure supply: How to share demand forecasts in a supply chain. Management Sci. (2001) 47(5):629–646Link, Google Scholar
• Deshpande V., Cohen M. A., Donohue K. A threshold inventory rationing policy for service-differentiated demand classes. Management Sci. (2003) 49(6):683–703Link, Google Scholar
• de Véricourt F., Gayon J. P., Keraesmen F. Stock rationing in a multi-class make-to-stock queue with information on the production status. (2004) . Working paper, Fuqua School of Business, Duke University, Durham, NCGoogle Scholar
• Gans N., Zhou Y. P. A call-routing problem with service-level constraints. Oper. Res. (2003) 51(2):255–271Link, 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
• Gurvich I. Design and control of the M/M/N queue with multi-class customers and many servers. (2004) . Masters thesis, Technion, Israel Institute of Technology, Haifa, IsraelGoogle Scholar
• Gurvich I., Whitt W. Service-level differentiation in many-server service systems: A solution based on fixed-queue-ratio routing. (2006) . Working paper, Columbia University, New YorkGoogle 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) 52(2):243–257Link, Google Scholar
• Harrison J. M., Zeevi A. A method for staffing large call centers based on stochastic fluid models. Manufacturing Service Oper. Management (2005) 7:20–36Link, Google Scholar
• Kella O., Yechiali U. Waiting times in the non-preemptive priority M/M/c queue. Stochastic Models (1985) 1(2):257–262Crossref, Google Scholar
• Koole G. Redefining the service level in call centers. (2003) . Technical report, Department of Stochastics, Vrije Universiteit, AmsterdamGoogle Scholar
• Maglaras C., Zeevi A. Pricing and design of differentiated services: Approximate analysis and structural insights. Oper. Res. (2005) 53(2):242–262Link, Google Scholar
• Mandelbaum A., Zeltyn S. Staffing many server queues with impatient customers: Constraint satisfaction in call centers. (2006) . Working paper, Technion, Israel Institute of Technology, Haifa, IsraelGoogle Scholar
• Massey A. W., Wallace B. R. An optimal design of the M/M/C/K queue for call centers. Queueing Systems (2006) . ForthcomingGoogle Scholar
• Milner J. M., Olsen T. L. Service-level agreements in call centers: Perils and prescriptions. Management Sci. (2008) 54(2):238–252Link, Google Scholar
• Pinker E. J., Shumsky R. A. The efficiency-quality trade-off of cross-trained workers. Manufacturing Service Oper. Management (2000) 2(1):32–48Link, Google Scholar
• Puhalskii A., Reiman M. A critically loaded multirate link with trunk reservation. Queueing Systems (1998) 28:157–190Crossref, Google Scholar
• Rafaeli A., Kedmi E., Vashdi D., Barron G. Queues and fairness: A multiple study investigation. (2005) . Technical report, Technion, Israel Institute of Technology, Haifa, IsraelGoogle Scholar
• Schaack C., Larson R. An N-server cutoff priority queue. Oper. Res. (1986) 34(2):257–266Link, Google Scholar
• Teh Y. C., Ward A. R. Critical thresholds for dynamic routing in queueing networks. Queueing Systems (2002) 42:297–316Crossref, Google Scholar
• Tezcan T., Dai J. G. Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. (2007) . ForthcomingGoogle Scholar
• Towsley D., Baccelli F. Comparisons of service disciplines in a tandem queueing network with real-time constraints. Oper. Res. Lett. (1991) 10:49–55Crossref, Google Scholar
• Wallace R. B., Whitt W. A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management (2005) 7(4):276–294Link, Google Scholar
• Whitt W. Heavy traffic approximations for service systems with blocking. AT&T Bell Laboratories Tech. J. (1984) 63(5):689–708Crossref, 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. Staffing a call center with uncertain arrival rate and absenteeism. Production Oper. Management (2006) 15(1):88–102Crossref, Google Scholar
• Wolff R. W.Stochastic Modeling and the Theory of Queues (1989) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Yahalom T., Mandelbaum A. Optimal scheduling of a multi-server multi-class non-preemptive queueing system. (2004) . Working paper, Technion, Israel Institute of Technology, Haifa, IsraelGoogle Scholar