Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers

References

• Aksin Z., Armony M., Mehrotra V., Shanthikumar G., Yao D. The modern call-center: A multi-disciplinary perspective on operations management research. Production and Operations Management. Special Issue on Service Operations in Honor of John Buzacott (2007) 16(6):665–688Crossref, Google Scholar
• Armony M. Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems (2005) 51(3–4):287–329Crossref, Google Scholar
• Armony M., Ward A. Fair dynamic routing in large-scale heterogeneous-server systems. Oper. Res. (2010) 58(3):624–637Link, Google Scholar
• Atar R. Central limit theorem for a many-server queue with random service rates. Ann. Appl. Probab. (2008) 18(4):1548–1568Crossref, Google Scholar
• Atar R., Shwartz A. Efficient routing in heavy traffic under partial sampling of service times. Math. Oper. Res. (2008) 33(4):899–909Link, Google Scholar
• Atar R., Giat C., Shimkin N. The cμ/θ rule for many-server queues with abandonment. Oper. Res. (2010) 58(5):1427–1439Link, Google Scholar
• Atar R., Mandelbaum A., Shaikhet G. Simplified control problems for multiclass many-server queueing systems. Math. Oper. Res. (2009) 34(4):795–812Link, Google Scholar
• Atar R., Shaki Y. Y., Shwartz A. A blind policy for equalizing cumulative idleness. Queueing Systems. (2011) . ForthcomingCrossref, Google Scholar
• Baron O., Milner J. Staffing to maximize profit for call centers with alternate service level agreements. Oper. Res. (2009) 57(3):685–700Link, 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: Theory Appl. (2006b) 51(3–4):249–285Crossref, Google Scholar
• Borst S., Mandelbaum A., Reiman M. Dimensioning large call centers. Oper. Res. (2003) 52(1):17–34Link, Google Scholar
• Cabral F. B. The slow server problem for uninformed customers. Queueing Systems (2005) 50(4):353–370Crossref, Google Scholar
• Dai J. G., Tezcan T. Optimal control of parallel server systems with many servers in heavy traffic. Queueing Systems (2008) 59(2):95–134Crossref, Google 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
• de Véricourt F., Zhou Y.-P. On the incomplete results for the heterogeneous server problem. Queueing Systems (2006) 52(3):189–191Crossref, Google Scholar
• Foschini G. J., Reiser M., Chandy K. On heavy traffic diffusion analysis and dynamic routing in packet switched networks. Computer Performance Measurements, Modeling, and Evaluation (1977) (North-Holland, Amsterdam) 499–514Google 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
• Gans N., Liu N., Mandelbaum A., Shen H., Ye H., Berger J. O., Cai T. T., Johnstone I. M. Service times in call centers: Agent heterogeneity and learning with some operational consequences. A Festschrift for Lawrence D. Brown (2010) 6(IMS, Beachwood, OH) 99–123IMS CollectionsCrossref, 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., Whitt W. Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. (2007a) 34(2):363–396Link, Google Scholar
• Gurvich I., Whitt W. Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management (2007b) 11(2):237–253Link, Google Scholar
• Gurvich I., Whitt W. Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. (2010) 58(2):316–328Link, Google Scholar
• Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29(3):567–588Link, 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(1):20–36Link, Google Scholar
• Larsen R. L., Agrawala A. K. Control of a heterogeneous two-server exponential queueing system. IEEE Trans. Software Engrg. (1983) July):522–526Crossref, Google Scholar
• Lin W., Kumar P. R. Optimal control of a queueing system with two heterogeneous servers. IEEE Trans. Automat. Control (1984) 29:696–703Crossref, 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
• Maglaras C., Zeevi A. Diffusion approximations for a multiclass Markovian service system with “guaranteed” and “best-effort” service levels. Math. Oper. Res. (2004) 29(4):786–813Link, Google 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. Oper. Res. (2009) 57(5):1189–1205Link, Google Scholar
• Mandelbaum A., Sakov A., Zeltyn S. Empirical analysis of a call center. (2000) . Technical report. Accessed January 14, 2011, http://iew3.technion.ac.il/serveng/References/references.htmlGoogle Scholar
• Rubinovich M. The slow server problem. J. Appl. Probab. (1983) 22:205–213Crossref, Google Scholar
• Stockbridge R. H. A martingale approach to the slow server problem. J. Appl. Probab. (1991) 28:480–486Crossref, Google Scholar
• Teh Y., Ward A. R. Critical thresholds for dynamic routing in queueing networks. Queueing Systems (2002) 42(3):297–316Crossref, Google Scholar
• Tezcan T. Asymptotically optimal control of many-server heterogeneous service systems with hyper-exponential service times. (2007) . Working paper, University of Illinois at Urbana-Champaign, UrbanaGoogle 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. (2010) 58(1):94–110Link, Google Scholar
• Tseytlin Y. Queueing systems with heterogeneous servers: Improving patients' flow in hospitals. (2007) . Technion M.Sc. research proposal, Technion, Haifa, IsraelGoogle 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. Two fluid approximations for multi-server queues with abandonments. Oper. Res. Lett. (2005) 33(4):363–372Crossref, Google Scholar
• Whitt W. Fluid models for multiserver queues with abandonments. Oper. Res. (2006a) 54(1):37–54Link, Google Scholar
• Whitt W. A multi-class fluid model for a contact center with skill-based routing. Internat. J. Electronics Comm. (AEU) (2006b) 60(2):95–102Crossref, Google Scholar
• Whitt W. Staffing a call center with uncertain arrival rate and absenteeism. Production Oper. Management (2006c) 15(1):88–102Crossref, Google Scholar