Managing Response Time in a Call-Routing Problem with Service Failure

Published Online:https://doi.org/10.1287/opre.1050.0230

References

  • 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–1134CrossrefGoogle 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–649CrossrefGoogle Scholar
  • Berk E., Moinzadeh K. The impact of discharge decisions on health care quality. Management Sci. (1998) 44(3):400–415LinkGoogle Scholar
  • Borst S., Mandelbaum A., Reiman M. Dimensioning large call centers. Oper. Res. (2004) 52(1):17–34LinkGoogle Scholar
  • De Angelis V. Planning home assistance for AIDS patients in the city of Rome, Italy. Interfaces (1998) 28(3):75–83LinkGoogle Scholar
  • de Véricourt F., Zhou Y.-P. Managing service time and service failure in a call routing problem. (2004) . Working paper, University of Washington, Seattle, WAGoogle Scholar
  • de Véricourt F., Zhou Y.-P. On the incomplete results for the multiple-server slow-server problem. (2005) . Technical report, Duke University, Durham, NCGoogle Scholar
  • Falin G. I., Templeton J. G. C.Retrial Queues (1997) (Chapman & Hall, London, UK) CrossrefGoogle Scholar
  • Gans N. Customer loyalty and supplier quality competition. Management Sci. (2002) 48(2):207–221LinkGoogle Scholar
  • Gans N., Zhou Y.-P. Managing learning and turnover in employee staffing. Oper. Res. (2002) 50(6):991–1006LinkGoogle Scholar
  • Gans N., Zhou Y.-P. A call-routing problem with service-level constraints. Oper. Res. (2003) 51(2):255–271LinkGoogle Scholar
  • Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management (2003) 5(2):79–141LinkGoogle Scholar
  • Ha A. Stock-rationing policy for a make-to-stock production system with two priority classes and backordering. Naval Res. Logist. (1997) 44:457–472CrossrefGoogle Scholar
  • Hall J., Porteus E. Customer service competition in capacitated systems. Manufacturing Service Oper. Management (2000) 2(2):144–165LinkGoogle Scholar
  • Harrison J. M., Lopéz M. J. Heavy traffic resource pooling in parallel-server systems. Queueing Systems (1999) 33(4):339–368CrossrefGoogle Scholar
  • Heskett J., Jones T., Loveman G., Sasser W. E., Schlesinger L. Putting the service-profit chain to work. Harvard Bus. Rev. (1994) March–April):164–174Google Scholar
  • Koole G. A simple proof of the optimality of a threshold policy in a two-server queueing system. Systems Control Lett. (1995) 26(5):301–303CrossrefGoogle Scholar
  • Larsen R., Agrawala A. K. Control of a heterogeneous two-server exponential queueing system. IEEE Trans. Software Engrg. (1983) 9(4):522–526CrossrefGoogle Scholar
  • Larsen R. L. Control of multiple exponential servers with application to computer systems. (1981) . Ph.D. dissertation, Department of Computer Science, University of Maryland, College Park, MDGoogle Scholar
  • Lin W., Kumar P. R. Optimal control of a queueing system with two heterogeneous servers. IEEE Trans. Automatic Control (1984) AC-29(8Google Scholar
  • Luh H., Viniotis I. Threshold control policies for heterogeneous server systems. Math. Methods Oper. Res. (2002) 55(1):121–142CrossrefGoogle Scholar
  • Mandelbaum A., Stolyar A. Gcμ scheduling of flexible servers: Asymptotic optimality in heavy traffic. (2002) . Technical report, Technion, Haifa, IsraelGoogle Scholar
  • Mandelbaum A., Massey W. A., Reiman M., Rider B., Key P., Smith D. Time varying multiserver queues with abandonment and retrials. Teletraffic Engineering in a Competitive World (1999a) (Elsevier)355–364ITC-16Google Scholar
  • Mandelbaum A., Massey W. A., Reiman M., Stolyar A. Waiting time asymptotics for time varying multiserver queues with abandonment and retrials. Thirty-Seventh Annual Allerton Conference (1999b) 1095–1104Google Scholar
  • Mandelbaum A., Massey W. A., Reiman M., Rider B., Stolyar A. Queue lengths and waiting times for multiserver queues with abandonment and retrials. Selected Proc. Fifth INFORMS Telecomm. Conf. (2000) Google Scholar
  • Puterman M. L.Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994) (John Wiley and Sons, New York) CrossrefGoogle Scholar
  • Read B. The struggling revolution. Call Center Magazine (2002) Dec. 4). Downloadable from http://www.callcentermagazine.com/article/CCM20021202S0005Google Scholar
  • Rykov V. V. Monotone control of queueing systems with heterogeneous servers. Queueing Systems (2001) 37(4):391–403CrossrefGoogle Scholar
  • Shumsky R., Pinker E. Gatekeepers and referrals in services. Management Sci. (2003) 49(7):839–856LinkGoogle Scholar
  • Teh Y.-C., Ward A. R. Critical thresholds for dynamic routing in queueing networks. Queueing Systems (2002) 42(3):297–316CrossrefGoogle Scholar
  • Van Mieghem J. A. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. (1995) 5(3):809–833CrossrefGoogle Scholar
  • Veatch M., Wein L. Scheduling a make-to-stock queue: Index policies and hedging points. Oper. Res. (1996) 44(4):634–647LinkGoogle Scholar
  • Walrand J. A note on “Optimal control of a queueing system with two heterogeneous servers.”. Systems Control Lett. (1984) 4(3):131–134CrossrefGoogle Scholar
  • Zeithaml V., Parasuraman A., Berry L. The nature and determinants of customer expectations of service. Acad. Marketing Sci. (1993) 21(1):1–12CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.