A Logarithmic Safety Staffing Rule for Contact Centers with Call Blending

Published Online:https://doi.org/10.1287/mnsc.2014.2019

References

  • Aksin Z, Armony M, Mehrotra V (2007) The modern call center: A multi-disciplinary perspective on operations management research. Production Oper. Management 16(6):665–688.CrossrefGoogle Scholar
  • Anderson CW (1970) Extreme value theory for a class of discrete distributions with applications to some stochastic processes. J. Appl. Probab. 7(1):99–113.CrossrefGoogle Scholar
  • Armony M, Gurvich I (2010) When promotions meet operations: Cross selling and its effect on call-center performance. Manufacturing Service Oper. Management 12(3):470–488.LinkGoogle Scholar
  • Armony M, Maglaras C (2004a) On customer contact centers with a call-back option: customer decisions, routing rules, and system design. Oper. Res. 52(2):271–292.LinkGoogle Scholar
  • Armony M, Maglaras C (2004b) Call centers with a call-back option and real-time delay information. Oper. Res. 52(4):527–545.LinkGoogle Scholar
  • Bassamboo A, Randhawa RS, Van Mieghem JA (2012) A little flexibility is all you need: On the asymptotic value of flexible capacity in parallel queuing systems. Oper. Res. 60(6):1423–1435.LinkGoogle Scholar
  • Bassamboo A, Randhawa RS, Zeevi A (2010) Capacity sizing under parameter uncertainty: Safety staffing principles revisited. Oper. Res. 56(10):1668–1686.Google Scholar
  • Ben-Chanoch E (2004) Outbound calling system in a contact center. U.S. Patent 6707906, filed March 13, 2000, issued March 16, 2004.Google Scholar
  • Bhulai S, Koole G (2003) A queueing model for call blending in call centers. IEEE Trans. Automatic Control 48(8):1434–1438.CrossrefGoogle Scholar
  • Deslauriers A, L’Ecuyer P, Pichitlamken J, Ingolfsson A, Avramidis AN (2007) Markov chain models of a telephone call center with call blending. Comput. Oper. Res. 34(6):1616–1645.CrossrefGoogle Scholar
  • Dumas G, Perkins MM, White CM (1996) Call sharing for inbound and outbound call center agents. U.S. Patent US5519773, filed June 7, 1994, issued May 21, 1996.Google Scholar
  • Erlang AK (1917) Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Electroteknikeren 13:5–13.Google Scholar
  • Gans N, Zhou Y-P (2003) A call-routing problem with service-level constraints. Oper. Res. 51(2):255–271.LinkGoogle Scholar
  • Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: Tutorial, review and research prospects. Manufacturing Service Oper. Management 5(2):79–141.LinkGoogle Scholar
  • Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manufacturing Service. Oper. Management 4(3):208–227.LinkGoogle Scholar
  • Gurvich I, Perry O (2012) Overflow networks: Approximations and implications to call-center outsourcing. Oper. Res. 60(4):996–1009.LinkGoogle Scholar
  • Gurvich I, Whitt W (2010) Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. 58(2):316–328.LinkGoogle Scholar
  • Gurvich I, Armony M, Maglaras C (2009) Cross-selling in a call center with a heterogeneous customer population. Oper. Res. 57(2):299–313.LinkGoogle Scholar
  • Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.LinkGoogle Scholar
  • Iglehart DL (1965) Limiting diffusion approximations for the many server queue and the repairman problem. J. Appl. Probab. 2(2):429–441.CrossrefGoogle Scholar
  • Khalil HK (2002) Nonlinear Systems (Prentice Hall, Upper Saddle River, NJ).Google Scholar
  • Mandelbaum A, Zeltyn S (2009) Staffing many-server queues with impatient customers: Constraint satisfaction in call centers. Oper. Res. 57(5):1189–1205.LinkGoogle Scholar
  • Marquez HJ (2003) Nonlinear Control Systems (Wiley, New York).Google Scholar
  • Pang G, Talreja R, Whitt W (2007) Martingale proofs of many-server heavy-traffic limits for Markovian queues. Probab. Surveys 4:193–267.CrossrefGoogle Scholar
  • Perry O, Whitt W (2011) A fluid approximation for service systems responding to unexpected overloads. Oper. Res. 59(5):1159–1170.LinkGoogle Scholar
  • Perry O, Whitt W (2013) A fluid limit for an overloaded X model via a stochastic averaging principle. Math. Oper. Res. 38(2):294–349.LinkGoogle Scholar
  • Perry O, Whitt W (2014) Diffusion approximation for an overloaded X model via a stochastic averaging principle. Queueing Systems 76(4):347–401.CrossrefGoogle Scholar
  • Reynolds P (2003) Call Center Staffing: The Complete, Practical Guide to Workforce Management (Call Center School Press, Naperville, IL).Google Scholar
  • Robert P (2003) Stochastic Networks and Queues (Springer-Verlag, Berlin).CrossrefGoogle Scholar
  • Samuelson DA (1999) Predictive dialing for outbound telephone call centers. Interfaces 29(5):66–81.LinkGoogle Scholar
  • Tsitsiklis JN, Xu K (2012) On the power of (even a little) resource pooling. Stochastic Systems 2:1–66.LinkGoogle Scholar
  • Whitt W (1999) Dynamic staffing in a telephone call center aiming to immediately answer all calls. Oper. Res. Lett. 24(5):205–212.CrossrefGoogle Scholar
  • Whitt W (2004) Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. 50(10):1449–1461.LinkGoogle 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.