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


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 33, No. 3, August 2008, pp. 561-586
DOI: 10.1287/moor.1070.0310
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 Google Scholar
Google Scholar
Right arrow Articles by Mandelbaum, A.
Right arrow Articles by Momcilovic, P.
Right arrow Search for Related Content

Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime

Avishai Mandelbaum, Petar Momcilovic

Industrial Engineering and Management, Technion, Haifa 3200, Israel
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109

avim{at}tx.technion.ac.il
petar{at}eecs.umich.edu

We consider a first-come first-served multiserver queue in the Quality- and Efficiency-Driven (QED) regime. In this regime, which was first formalized by Halfin and Whitt, the number of servers N is not small, servers' utilization is Formula(Efficiency-Driven) while waiting time is Formula(Quality-Driven). This is equivalent to having the number of servers N being approximately equal to Formula, where R is the offered load and β is a positive constant.

For the G/DK/N queue in the QED regime, we analyze the virtual waiting time VN(t), as N increases indefinitely. Assuming that the service-time distribution has a finite support (hence the DK in G/DK/N), it is shown that, in the limit, the scaled virtual waiting time Formula is representable as a supremum over a random weighted tree (S denotes a service time). Informally, it is then argued that, for large N,

Formula
here Formula is the averaging of Formula over S, and the process Formulais zero-mean Gaussian that summarizes all relevant information about arrivals and service times (Formula arises as a limit of an infinite-server (G/DK/{infty}) process, appropriately scaled). The results are obtained by using both combinatorial and probabilistic arguments. Possible applications of our approximations include fast simulation of queues and estimation/prediction of customer waiting times in the QED regime.

Key Words: multiserver queue; heavy-traffic; quality- and efficiency-driven (QED) or Halfin–Whitt regime; economies of scale; telephone call or contact centers
History: Received: August 30, 2005; revision received: August 29, 2007;





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