Technical Note—What’s in a Constraint? On the Ambiguity of Standard Delay Targets

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

References

  • Aksin Z, Ata B, Emadi SM, Su C-L (2013) Structural estimation of callers’ delay sensitivity in call centers. Management Sci. 59(12):2727–2746.LinkGoogle Scholar
  • Allon G, Federgruen A, Pierson M (2011) How much is a reduction of your customers’ wait worth? An empirical study of the fast-food drive-thru industry based on structural estimation methods. Manufacturing Service Oper. Management 13(4):489–507.LinkGoogle Scholar
  • Ata B, Olsen TL (2009) Near-optimal dynamic lead-time quotation and scheduling under convex-concave customer delay costs. Oper. Res. 57(3):753–768.LinkGoogle Scholar
  • Atar R (2005) Scheduling control for queueing systems with many servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. 15(4):2606–2650.CrossrefGoogle Scholar
  • Atar R, Mandelbaum A, Reiman MI (2004) Scheduling a multi class queue with many exponential servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. 14(3):1084–1134.CrossrefGoogle Scholar
  • Bassamboo A, Harrison JM, Zeevi A (2006) Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. 54(3):419–435.LinkGoogle 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 (2009) 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
  • Gurvich I, Huang J, Mandelbaum A (2014) Excursion-based universal approximations for the erlang-a queue in steady-state. Math. Oper. Res. 39(2):325–373.LinkGoogle Scholar
  • Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.LinkGoogle Scholar
  • Jouini O, Pot A, Koole G, Dallery Y (2010) Online scheduling policies for multiclass call centers with impatient customers. Eur. J. Oper. Res. 207(1):258–268.CrossrefGoogle Scholar
  • Koole G (2013) Call Center Optimization (MG Books, Amsterdam).Google Scholar
  • Mehrotra V, Ross K, Ryder G, Zhou YP (2012) Routing to manage resolution and waiting time in call centers with heterogeneous servers. Manufacturing Service Oper. Management 14(1):66–81.LinkGoogle Scholar
  • Milner JM, Olsen TL (2008) Service level agreements in call centers: Perils and prescriptions. Management Sci. 54(2):238–252.LinkGoogle Scholar
  • Pang G, Perry O (2015) A logarithmic safety staffing rule for contact centers with call blending. Management Sci. 61(1):73–91.LinkGoogle Scholar
  • Perry O, Whitt W (2009) Responding to unexpected overloads in large-scale service systems. Management Sci. 55(8):1353–1367.LinkGoogle Scholar
  • Pot A, Bhulai S, Koole G (2008) A simple staffing method for multiskill call centers. Manufacturing Service Oper. Management 10(3):421–428.LinkGoogle Scholar
  • Soh S, Gurvich I (2017) Call center staffing: Service-level constraints and index priorities. Oper. Res. 65(2):537–555.LinkGoogle Scholar
  • Tezcan T, Dai JG (2010) Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. 58(1):94–110.LinkGoogle Scholar
  • Vasicek OA (1977) An inequality for the variance of waiting time under a general queuing discipline. Oper. Res. 25(5):879–884.LinkGoogle Scholar
  • Wallace RB, Whitt W (2005) A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management 7(4):276–294.LinkGoogle Scholar
  • Zhang Z, Dey D, Tan Y (2007) Pricing communication services with delay guarantee. INFORMS J. Comput. 19(2):248–260.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.