Call Center Staffing: Service-Level Constraints and Index Priorities

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

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
  • Armony M (2005) Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems 51(3–4):287–329.CrossrefGoogle Scholar
  • Armony M, Mandelbaum A (2011) Routing and staffing in large-scale service systems: The case of homogeneous impatient customers and heterogeneous servers. Oper. Res. 59(1):50–65.LinkGoogle Scholar
  • Billingsley P (1999) Convergence of Probability Measures, 2nd ed. (Wiley, New York).CrossrefGoogle Scholar
  • Borst S, Mandelbaum A, Reiman M (2004) Dimensioning large call centers. Oper. Res. 52(1):17–34.LinkGoogle Scholar
  • Chan W, Koole G, L’Ecuyer P (2014) Dynamic call center routing policies using call waiting and agent idle times. Manufacturing Service Oper. Management 16(4):544–560.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, Whitt W (2009a) Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. 34(2):363–396.LinkGoogle Scholar
  • Gurvich I, Armony M, Mandelbaum A (2008) Service level differentiation in call centers with fully flexible servers. Management Sci. 54(2):279–294.LinkGoogle Scholar
  • Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.LinkGoogle Scholar
  • Koole G (2013) Call Center Optimization (MG Books, Amsterdam).Google Scholar
  • Koole G, Pot A (2006) An overview of routing and staffing algorithms in multi-skill customer contact centers. Technical report, Vrije Universiteit Amsterdam.Google Scholar
  • Mandelbaum A, Stolyar S (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6):836–855.LinkGoogle Scholar
  • Van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Prob. 5(3):809–833.CrossrefGoogle Scholar
  • Whitt W (2002) Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues (Springer, New York).CrossrefGoogle 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.