Dynamic Scheduling in a Many-Server, Multiclass System: The Role of Customer Impatience in Large Systems

References

• Atar R, Giat C, Shimkin N (2010) The cμ/θ rule for many-server queues with abandonment. Oper. Res. 58(5):1427–1439.Link, Google Scholar
• Atar R, Giat C, Shimkin N (2011) On the asymptotic optimality of the cμ/θ rule under ergodic cost. Queueing Systems 67(2):127–144.Crossref, Google Scholar
• Atar R, Kaspi H, Shimkin N (2013) Fluid limits for many-server systems with reneging under a priority policy. Math. Oper. Res. 39(3):672–696.Link, Google 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.Crossref, Google Scholar
• Atar R, Mandelbaum A, Shaikhet G (2009) Simplified control problems for multiclass many-server queueing systems. Math. Oper. Res. 34(4):795–812.Link, Google Scholar
• Bassamboo A, Randhawa RS (2010) On the accuracy of fluid models for capacity sizing in queueing systems with impatient customers. Oper. Res. 58(5):1398–1413.Link, Google Scholar
• Bassamboo A, Randhawa RS (2015) Scheduling homogeneous impatient customers. Management Sci. 62(7):2129–2147.Link, Google Scholar
• Brown L, Gans N, Mandelbaum A, Sakov A, Shen H, Zeltyn S, Zhao L (2005) Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. 100(469):36–50.Crossref, Google Scholar
• Çelik S, Maglaras C (2008) Dynamic pricing and lead-time quotation for a multiclass make-to-order queue. Management Sci. 54(6):1132–1146.Link, Google Scholar
• Dai JG, He S (2010) Customer abandonment in many-server queues. Math. Oper. Res. 35(2):347–362.Link, Google Scholar
• Dai J, He S (2011) Queues in service systems: Customer abandonment and diffusion approximations. Geunes J, ed. Tutorials in Operations Research: Transforming Research into Action (INFORMS, Hanover, MD), 36–59.Link, Google Scholar
• Dai JG, He S (2013) Many-server queues with customer abandonment: Numerical analysis of their diffusion model. Stochastic Systems 3(1):96–146.Link, Google Scholar
• Down DG, Koole G, Lewis ME (2011) Dynamic control of a single-server system with abandonments. Queueing Systems 67(1):63–90.Crossref, Google Scholar
• Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manfacturing Service Oper. Management 4(3):208–227.Link, Google Scholar
• Ghamami S, Ward AR (2013) Dynamic scheduling of a two-server parallel server system with complete resource pooling and reneging in heavy traffic: Asymptotic optimality of a two-threshold policy. Math. Oper. Res. 38(4):761–824.Link, Google Scholar
• Gurvich I, Whitt W (2009) Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. 34(2):363–396.Link, Google Scholar
• Gurvich I, Whitt W (2010) Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. 58(2): 316–328.Link, Google Scholar
• Gurvich I, Armony M, Mandelbaum A (2008) Service-level differentiation in call centers with fully flexible servers. Management Sci. 54(2):279–294.Link, Google Scholar
• Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.Link, Google Scholar
• Harrison JM, Zeevi A (2004) Dynamic scheduling of a multiclass queue in the Halfin-Whitt heavy traffic regime. Oper. Res. 52(2): 243–257.Link, Google Scholar
• Huang J, Zhang H, Zhang J (2016) A unified approach to diffusion analysis of queues with general patience-time distributions. Math. Oper. Res. 41(3):1135–1160.Link, Google Scholar
• Kang W, Ramanan K (2010) Fluid limits of many-server queues with reneging. Ann. Appl. Probab. 20(6):2204–2260.Crossref, Google Scholar
• Katsuda T (2015) General hazard-type scaling of abandonment time distribution for a G/Ph/n+GI queue in the Halfin–Whitt heavy-traffic regime. Queueing Systems 80(1–2):155–195.Crossref, Google Scholar
• Kim J, Ward AR (2013) Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes. Queueing Systems 75(2):339–384.Crossref, Google Scholar
• Kort BW (1983) Models and methods for evaluating customer acceptance of telephone connections. Proc. IEEE GLOBECOM’83 (IEEE, New York), 706–714.Google Scholar
• Long Z, Zhang J (2015) Virtual allocation policies for many-server queues with abandonment. Working paper, Technion—Israel Institute of Technology, Haifa.Google Scholar
• Mandelbaum A, Momčilović P (2012) Queues with many servers and impatient customers. Math. Oper. Res. 37(1):41–65.Link, Google Scholar
• Mandelbaum A, Stolyar AL (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6):836–855.Link, Google Scholar
• Mandelbaum A, Zeltyn S (2013) Data-stories about (im)patient customers in tele-queues. Queueing Systems 75(2–4):115–146.Crossref, Google Scholar
• Øksendal B (2003) Stochastic differential equations. Stochastic Differential Equations: An Introduction with Applications (Springer, Berlin), 65–84.Crossref, Google Scholar
• Pinedo ML (1995) Scheduling: Theory, Algorithms, and Systems (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
• Reed J, Tezcan T (2012) Hazard rate scaling of the abandonment distribution for the GI/M/N+GI queue in heavy traffic. Oper. Res. 60(4):981–995.Link, Google Scholar
• Reed JE, Ward AR (2008) Approximating the GI/GI/1+GI queue with a nonlinear drift diffusion: Hazard rate scaling in heavy traffic. Math. Oper. Res. 33(3):606–644.Link, Google Scholar
• Reiman MI (1982) The heavy traffic diffusion approximation for sojourn times in Jackson networks. Disney RL, Ott TJ, eds. Applied Probability-Computer Science: The Interface, Vol. 1 (Birkhäuser, Boston), 409–421.Crossref, Google Scholar
• Rubino M, Ata B (2009) Dynamic control of a make-to-order, parallel-server system with cancellations. Oper. Res. 57(1):94–108.Link, Google Scholar
• Smith W (1956) Various optimizers for single-stage production. Naval Res. Logist. Quart. 3(1–2):59–66.Crossref, Google Scholar
• Van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5(3):809–833.Crossref, Google Scholar
• Ward AR, Glynn PW (2005) A diffusion approximation for a GI/GI/1 queue with balking or reneging. Queueing Systems 50(4):371–400.Crossref, Google Scholar
• Weerasinghe A (2014) Diffusion approximations for G/M/n+GI queues with state-dependent service rates. Math. Oper. Res. 39(1):207–228.Link, Google Scholar
• Whitt W (2005) Engineering solution of a basic call-center model. Management Sci. 51(2): 221–235.Link, Google Scholar
• Whitt W (2006) Fluid models for multiserver queues with abandonments. Oper. Res. 54(1):37–54.Link, Google Scholar
• Zeltyn S, Mandelbaum A (2005) Call centers with impatient customers: Many-server asymptotics of the M/M/N+G queue. Queueing Systems 51(3–4):361–402.Crossref, Google Scholar
• Zhang J (2013) Fluid models of many-server queues with abandonment. Queueing Systems 73(2):147–193.Crossref, Google Scholar