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


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 30, No. 1, February 2005, pp. 1-27
DOI: 10.1287/moor.1040.0119
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 Whitt, W.
Right arrow Search for Related Content

Heavy-Traffic Limits for the G/H2*/n/mQueue

Ward Whitt

Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027
ww2040{at}columbia.edu

We establish heavy-traffic stochastic-process limits for queue-length, waiting-time and overflow stochastic processes in a class of G/GI/n/m queueing models with n servers and m extra waiting spaces. We let the arrival process be general, only requiring that it satisfy a functional central limit theorem. To capture the impact of the service-time distribution beyond its mean within a Markovian framework, we consider a special class of service-time distributions, denoted by H2*, which are mixtures of an exponential distribution with probability p and a unit point mass at 0 with probability 1–p. These service-time distributions exhibit relatively high variability, having squared coefficients of variation greater than or equal to one. As in Halfin and Whitt (1981, Heavy-traffic limits for queues with many exponential servers, Oper. Res. 29 567–588), Puhalskii and Reiman (2000, The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. Appl. Probab. 32 564–595), and Garnett, Mandelbaum, and Reiman (2002. Designing a call center with impatient customers. Manufacturing Service Oper. Management, 4 208–227), we consider a sequence of queueing models indexed by the number of servers, n, and let n tend to infinity along with the traffic intensities Pn so that {surd}n (1 – Pn) -> ß for –{infty} < ß < {infty}. To treat finite waiting rooms, we let mn{surd}n -> {kappa} for 0 < {kappa} < {infty}. With the special H2* service-time distribution, the limit processes are one-dimensional Markov processes, behaving like diffusion processes with different drift and diffusion functions in two different regions, above and below zero. We also establish a limit for the G/M/n/m+M model, having exponential customer abandonments.

Key Words: queues; multiserver queues; stochastic-process limits; heavy-traffic; Halfin-Whitt regime; diffusion approximations; abandonments; reneging; customer impatience
History: Received: July 17, 2002; revision received: June 30, 2003;revision received: December 22, 2003;revision received: May 26, 2004;


This article has been cited by other articles:


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
Mathematics of Operations ResearchHome page
T. Tezcan
Optimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime
Mathematics of Operations Research, February 1, 2008; 33(1): 51 - 90.
[Abstract] [PDF]


Home page
Management ScienceHome page
W. Whitt
Engineering Solution of a Basic Call-Center Model
Management Science, February 1, 2005; 51(2): 221 - 235.
[Abstract] [PDF]




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