Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic

We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal. Our cost is an expected cumulative discounted function, linear or nonlinear, of appropriately normalized performance measures. As a special case, the cost per unit time can be a function of the number of customers waiting to be served in each class, the number actually being served, the abandonment rate, the delay experienced by customers, the number of idling servers, as well as certain combinations thereof. We study the system in an asymptotic heavy-traffic regime where the number of servers n and the offered load r are simultaneously scaled up and carefully balanced: n\approx r+\beta \sqrtr for some scalar \beta. This yields an operation that enjoys the benefits of both heavy traffic (high server utilization) and light traffic (high service levels.)

[1]  Sem C. Borst,et al.  Dimensioning Large Call Centers , 2000, Oper. Res..

[2]  P. Protter,et al.  Weak Limit Theorems for Stochastic Integrals and Stochastic Differential Equations , 1991 .

[3]  Ina Ruck,et al.  USA , 1969, The Lancet.

[4]  P. Protter.  Stochastic integration and differential equations , 1990 .

[5]  Avishai Mandelbaum,et al.  A Brownian control problem for a simple queueing system in the Halfin-Whitt regime , 2004, Syst. Control. Lett..

[6]  J. C. Burkill,et al.  Ordinary Differential Equations , 1964 .

[7]  J. Michael Harrison,et al.  Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .

[8]  P. Protter.  Stochastic integration and differential equations : a new approach , 1990 .

[9]  W. Fleming,et al.  Controlled Markov processes and viscosity solutions , 1992 .

[10]  Ronald J. Williams,et al.  Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .

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

[12]  H. Ishii.  On uniqueness and existence of viscosity solutions of fully nonlinear second‐order elliptic PDE's , 1989 .

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

[14]  Avishai Mandelbaum,et al.  Designing a Call Center with Impatient Customers , 2002, Manuf. Serv. Oper. Manag..

[15]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..

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

[17]  Avishai Mandelbaum,et al.  Adaptive Behavior of Impatient Customers in Tele-Queues: Theory and Empirical Support , 2002, Manag. Sci..

[18]  D. Iglehart,et al.  The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums , 1971 .

[19]  A. Stolyar,et al.  Heavy tra c limits for a mobile phone system loss model , 1994 .

[20]  J. Michael Harrison,et al.  Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime , 2004, Oper. Res..

[21]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[22]  L. F. Martins,et al.  Heavy Traffic Convergence of a Controlled, Multiclass Queueing System , 1996 .

[23]  P. Bassanini,et al.  Elliptic Partial Differential Equations of Second Order , 1997 .

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

[25]  M. Reiman,et al.  The multiclass GI/PH/N queue in the Halfin-Whitt regime , 2000, Advances in Applied Probability.

[26]  R. Durrett.  Probability: Theory and Examples , 1993 .

[27]  Erica L. Plambeck,et al.  A Multiclass Queue in Heavy Traffic with Throughput Time Constraints: Asymptotically Optimal Dynamic Controls , 2001, Queueing Syst. Theory Appl..

[28]  Sunil Kumar.  Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality , 2000 .

[29]  Jan A. Van Mieghem,et al.  Dynamic Control of Brownian Networks: State Space Collapse and Equivalent Workload Formulations , 1997 .

[30]  H. Kushner,et al.  Optimal control of assignment of jobs to processors under heavy traffic , 2000 .

[31]  Avishai Mandelbaum,et al.  An Introduction to Skills-Based Routing and its Operational Complexities , 2003 .

[32]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[33]  R. J. Williams.  Review: Philip Protter, Stochastic integration and differential equations— a new approach , 1991 .

[34]  P. Kandela.  Israel , 1989, The Lancet.

[35]  Elena V. Krichagina,et al.  Diffusion approximation forGI/G/1 controlled queues , 1992, Queueing Syst. Theory Appl..

[36]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .

[37]  D. Jagerman.  Some properties of the erlang loss function , 1974 .

[38]  Vivek S. Borkar,et al.  Optimal Control of Diffusion Processes , 1989 .