The c / Rule for Many-Server Queues with Abandonment

We consider a multiclass queueing system with multiple homogeneous servers and customer abandonment. For each customer class i, the holding cost per unit time, the service rate, and the abandonment rate are denoted by ci, i, and i, respectively. We prove that under a many-server fluid scaling and overload conditions, a server-scheduling policy that assigns priority to classes according to their index ci i/ i is asymptotically optimal for minimizing the overall long-run average holding cost. An additional penalty on customer abandonment is easily incorporated into this model and leads to a similar index rule.

[1]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[2]  N. G. Parke,et al.  Ordinary Differential Equations. , 1958 .

[3]  G. Klimov.  Time-Sharing Service Systems. I , 1975 .

[4]  P. Brémaud.  Point Processes and Queues , 1981 .

[5]  Jean Walrand,et al.  The c# rule revisited , 1985 .

[6]  J. Baras,et al.  Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal , 1985, Advances in Applied Probability.

[7]  Armand M. Makowski,et al.  K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal☆ , 1985 .

[8]  M. Kijima,et al.  FURTHER RESULTS FOR DYNAMIC SCHEDULING OF MULTICLASS G/G/1 QUEUES , 1989 .

[9]  Don Towsley,et al.  Optimal scheduling in a machine with stochastic varying processing rate , 1994, IEEE Trans. Autom. Control..

[10]  J. V. Mieghem.  Dynamic Scheduling with Convex Delay Costs: The Generalized CU Rule , 1995 .

[11]  Avishai Mandelbaum,et al.  Strong approximations for Markovian service networks , 1998, Queueing Syst. Theory Appl..

[12]  Jan A. Van Mieghem.  Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules , 2003, Oper. Res..

[13]  Avishai Mandelbaum,et al.  Telephone Call Centers: Tutorial, Review, and Research Prospects , 2003, Manuf. Serv. Oper. Manag..

[14]  Ward Whitt,et al.  Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments , 2004, Manag. Sci..

[15]  D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.

[16]  A. Mandelbaum,et al.  Design , staffing and control of large service systems : The case of a single customer class and multiple server types , 2004 .

[17]  Alexander L. Stolyar,et al.  Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule , 2004, Oper. Res..

[18]  Rami Atar,et al.  Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic , 2004, math/0407058.

[19]  J. Michael Harrison,et al.  Dynamic Routing and Admission Control in High-Volume Service Systems: Asymptotic Analysis via Multi-Scale Fluid Limits , 2005, Queueing Syst. Theory Appl..

[20]  Ward Whitt,et al.  Fluid Models for Multiserver Queues with Abandonments , 2006, Oper. Res..

[21]  Ward Whitt,et al.  A multi-class fluid model for a contact center with skill-based routing , 2006 .

[22]  J. Michael Harrison,et al.  Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method , 2006, Oper. Res..

[23]  J. Reed,et al.  The G/GI/N queue in the Halfin–Whitt regime , 2009, 0912.2837.

[24]  Lubov Rozenshmidt.  On Priority Queues with Impatient Customers : Stationary and Time-Varying Analysis RESEARCH THESIS SUBMITTED IN PARTIAL FULFILLMENT OF REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN OPERATIONS RESEARCH AND SYSTEMS ANALYSIS , 2007 .

[25]  Kavita Ramanan,et al.  Law of large numbers limits for many-server queues , 2007, 0708.0952.

[26]  Nahum Shimkin,et al.  The cμ/θ rule , 2008, VALUETOOLS.

[27]  Zeynep Akşin,et al.  The Modern Call Center: A Multi‐Disciplinary Perspective on Operations Management Research , 2007 .

[28]  K. Ramanan,et al.  Fluid limits of many-server queues with reneging , 2010, 1011.2921.

[29]  Ward Whitt,et al.  A Fluid Approximation for Service Systems Responding to Unexpected Overloads , 2011, Oper. Res..