Queueing Systems

, Volume 51, Issue 3–4, pp 249–285

Dynamic Routing and Admission Control in High-Volume Service Systems: Asymptotic Analysis via Multi-Scale Fluid Limits

  • Achal Bassamboo
  • J. Michael Harrison
  • Assaf Zeevi


Motivated by applications in telephone call centers, we consider a service system model with m customer classes and r server pools. The model is one with doubly stochastic arrivals, which means that the m-vector λ of instantaneous arrival rates is allowed to vary both temporally and stochastically. Two levels of dynamic control are considered: customers may be either blocked or accepted at the time of their arrival, and then accepted customers of each class must be routed, either immediately upon acceptance or after some period of waiting, to a server pool that is qualified to handle that class. Customers who are made to wait before commencement of their service are liable to defect. The objective is to minimize the expected sum of blocking costs, waiting costs and defection costs over a fixed and finite planning horizon. We consider an asymptotic parameter regime in which (i) the arrival rates, service rates and defection rates are uniformly accelerated by a large factor κ, then (ii) arrival rates are increased by an additional factor g(κ), and the number of servers in each pool is increased by g(κ) as well. This produces a separation of time scales, justifying a pointwise stationary stochastic fluid approximation for our original system model. In the stochastic fluid approximation, optimal admission control and routing decisions are determined by a simple linear program that uses the current arrival rate vector λ as data. We explain how to implement the fluid model's optimal control policy in our original service system context, and prove that the proposed implementation is asymptotically optimal in the first-order sense.


call centers queueing admission control dynamic routing fluid limits doubly stochastic asymptotic analysis performance bounds abandonments 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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 (To appear 2005).Google Scholar
  2. [2]
    P. Bremaud, Point Processes and Queues: Martingale Dynamics., (Springer Verlag, New York, 1981).Google Scholar
  3. [3]
    N. Gans, G. Koole and A. Mandelbaum, Telephone call centers: Tutorial, review, and research prospects, {Manufacturing & Service Operations Management} 5 (2003) 79–141.Google Scholar
  4. [4]
    L. Green and P. Kolesar, The pointwise stationary approximation for queues with nonstationary arrivals, {Management Science} {37} (1991) 84–97.CrossRefGoogle Scholar
  5. [5]
    S. Halfin and W. Whitt, Heavy-traffic limits for queues with many exponential servers, {Operations Research} {29} (1981) 567–588.Google Scholar
  6. [6]
    J.M. Harrison and M. Lopez, Heavy traffic resource pooling in parallel-server systems, {Queueing Systems} {33} (1999) 339–368.CrossRefGoogle Scholar
  7. [7]
    J.M. Harrison and A. Zeevi, Dynamic scheduling of a multi-class queue in the Halfin-Whitt heavy traffic regime, {Operations Research} {52} (2004) 243–257.CrossRefGoogle Scholar
  8. [8]
    J.M. Harrison and A. Zeevi, A method for staffing large call centers based on stochastic fluid models, {Manufacturing & Service Operations Management} 7 (2005) 20–36.Google Scholar
  9. [9]
    J. Komlós, P. Major and G. Tusnady, An approximation of partial sums of independent random variables and the sample distribution I, {Z. Wahr. und Verw. Gebiete} {32} (1975) 111–131.Google Scholar
  10. [10]
    T. Kurtz, Strong approximation theorems for density dependent Markov chains, {Stochastic Processes and Their Applications} {6} (1978) 223–240.CrossRefGoogle Scholar
  11. [11]
    C. Maglaras and J. Van Mieghem, Admission and sequencing control under delay constraints with applications to GPS and GLQ. To appear in the European Journal of Operations Research (2004).Google Scholar
  12. [12]
    A. Mandelbaum, W. Massey and M. Reiman, Strong approximations for Markovian service networks, {Queueing Systems, Theory and Applications (QUESTA)} 30 (1998) 149–201 .Google Scholar
  13. [13]
    W.A. Massey and W. Whitt, Uniform acceleration expansions for Markov chains with time-varying rates, {Annals of Applied Probabability} 8(4) (1998) 1130–1155.Google Scholar
  14. [14]
    E. Plambeck, S. Kumar and J.M. Harrison, A multiclass queue in heavy traffic with throughput time constraints: Asymptotically optimal dynamic controls, {Queueing Systems} {39} (2001) 23–54.CrossRefGoogle Scholar
  15. [15]
    W. Whitt, Comparing counting processes and queues, {Advances in Applied Probability} {13} (1981) 207–220.Google Scholar
  16. [16]
    W. Whitt, The pointwise stationary approximation for M.t./M.t./s. queues is asymptotically correct as the rates increase, {Management Science} {37} (1991) 307–314.Google Scholar
  17. [17]
    W. Whitt, Stochastic-Process Limits., (Springer-Verlag, New York, 2002).Google Scholar
  18. [18]
    W. Whitt, Fluid models for many-server queues with abandonments, Working paper (2004). To appear in Operations Research.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Achal Bassamboo
    • 1
  • J. Michael Harrison
    • 1
  • Assaf Zeevi
    • 2
  1. 1.Graduate School of BusinessStanford UniversityUSA
  2. 2.Graduate School of BusinessColumbia UniversityUSA

Personalised recommendations