Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 52, No. 2, March-April 2004, pp. 243-257
DOI: 10.1287/opre.1030.0084
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Harrison, J. M.
Right arrow Articles by Zeevi, A.
Right arrow Search for Related Content

Dynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime

J. Michael Harrison, Assaf Zeevi

Graduate School of Business, Stanford University, Stanford, California
Graduate School of Business, Columbia University, New York, New York 10027

harrison_michael{at}gsb.stanford.edu
assaf{at}gsb.columbia.edu

We consider a Markovian model of a multiclass queueing system in which a single large pool of servers attends to the various customer classes. Customers waiting to be served may abandon the queue, and there is a cost penalty associated with such abandonments. Service rates, abandonment rates, and abandonment penalties are generally different for the different classes. The problem studied is that of dynamically scheduling the various classes. We consider the Halfin-Whitt heavy traffic regime, where the total arrival rate and the number of servers both become large in such a way that the system's traffic intensity parameter approaches one. An approximating diffusion control problem is described and justified as a purely formal (that is, nonrigorous) heavy traffic limit. The Hamilton-Jacobi-Bellman equation associated with the limiting diffusion control problem is shown to have a smooth (classical) solution, and optimal controls are shown to have an extremal or "bang-bang" character. Several useful qualitative insights are derived from the mathematical analysis, including a "square-root rule" for sizing large systems and a sharp contrast between system behavior in the Halfin-Whitt regime versus that observed in the "conventional" heavy traffic regime. The latter phenomenon is illustrated by means of a numerical example having two customer classes.

Subject classifications: scheduling; queueing; diffusion approximations; many server limits; Halfin-Whitt regime; stochastic control; numerical methods.
History: Received January 2002; revision received July 2002; accepted March 2003.




This article has been cited by other articles:


Home page
Operations ResearchHome page
K. D. Glazebrook, C. Kirkbride, and J. Ouenniche
Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
Operations Research, July 1, 2009; 57(4): 975 - 989.
[Abstract] [PDF]


Home page
Operations ResearchHome page
O. Baron and J. Milner
Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements
Operations Research, May 1, 2009; 57(3): 685 - 700.
[Abstract] [PDF]


Home page
Operations ResearchHome page
A. Bassamboo and A. Zeevi
On a Data-Driven Method for Staffing Large Call Centers
Operations Research, May 1, 2009; 57(3): 714 - 726.
[Abstract] [PDF]


Home page
MSOMHome page
I. Gurvich and W. Whitt
Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems
MSOM, April 1, 2009; 11(2): 237 - 253.
[Abstract] [PDF]


Home page
Mathematics of Operations ResearchHome page
A. Mandelbaum and P. Momcilovic
Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime
Mathematics of Operations Research, August 1, 2008; 33(3): 561 - 586.
[Abstract] [PDF]


Home page
Management ScienceHome page
I. Gurvich, M. Armony, and A. Mandelbaum
Service-Level Differentiation in Call Centers with Fully Flexible Servers
Management Science, February 1, 2008; 54(2): 279 - 294.
[Abstract] [PDF]


Home page
Operations ResearchHome page
F. de Vericourt and O. B. Jennings
Dimensioning Large-Scale Membership Services
Operations Research, January 1, 2008; 56(1): 173 - 187.
[Abstract] [PDF]


Home page
MSOMHome page
N. Gans and Y.-P. Zhou
Call-Routing Schemes for Call-Center Outsourcing
MSOM, January 1, 2007; 9(1): 33 - 50.
[Abstract] [PDF]


Home page
Operations ResearchHome page
A. Bassamboo, J. M. Harrison, and A. Zeevi
Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method
Operations Research, May 1, 2006; 54(3): 419 - 435.
[Abstract] [PDF]


Home page
Operations ResearchHome page
C. Maglaras and A. Zeevi
Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights
Operations Research, March 1, 2005; 53(2): 242 - 262.
[Abstract] [PDF]


Home page
MSOMHome page
J. M. Harrison and A. Zeevi
A Method for Staffing Large Call Centers Based on Stochastic Fluid Models
MSOM, January 1, 2005; 7(1): 20 - 36.
[Abstract] [PDF]


Home page
Mathematics of Operations ResearchHome page
C. Maglaras and A. Zeevi
Diffusion Approximations for a Multiclass Markovian Service System with "Guaranteed" and "Best-Effort" Service Levels
Mathematics of Operations Research, November 1, 2004; 29(4): 786 - 813.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2004 by INFORMS.