Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments

Published Online:https://doi.org/10.1287/mnsc.1040.0279

References

  • Billingsley P.Convergence of Probability Measures (1999) 2nd ed.(John Wiley and Sons, New York) CrossrefGoogle Scholar
  • Brandt A., Brandt M. On the M(n)/M(n)/s queue with impatient calls. Performance Eval. (1999) 35:1–18CrossrefGoogle Scholar
  • Brandt A., Brandt M. Asymptotic results and a Markovian approximation for the M(n)/M(n)/s + GI system. Queueing Systems (2002) 41:73–94CrossrefGoogle Scholar
  • Browne S., Whitt W., Dshalalow J. D. Piecewise-linear diffusion processes. Advances in Queueing (1995) (CRC Press, Boca Raton, FL) 463–480Google Scholar
  • Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review and research prospects. Manufacturing Service Oper. Management (2003) 5:79–141LinkGoogle Scholar
  • Garnett O., Mandelbaum A., Reiman M. I. Designing a call center with impatient customers. Manufacturing Service Oper. Management (2002) 4:208–227LinkGoogle Scholar
  • Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29:567–588LinkGoogle Scholar
  • Iglehart D. L. Limit diffusion approximations for the many server queue and the repairman problem. J. Appl. Probab. (1965) 2:429–441CrossrefGoogle Scholar
  • Jelenkovic P., Mandelbaum A., Momcilovic P. Heavy traffic limits for queues with many deterministic servers. Queueing Systems (2004) 47:53–69CrossrefGoogle Scholar
  • Karlin S., Taylor H. M.A Second Course in Stochastic Processes (1981) (Academic Press, New York) Google Scholar
  • Mandelbaum A. Call centers. Research bibliography with abstracts. (2001) . Industrial Engineering and Management, Technion, Haifa, IsraelGoogle Scholar
  • Mandelbaum A., Pats G., Kelly F. P., Williams R. J. State-dependent queues: Approximations and applications. Stochastic Networks (1995) 71(Springer-Verlag, New York) 239–282Institute for Mathematics and Its ApplicationsCrossrefGoogle Scholar
  • Mandelbaum A., Zeltyn S. The impact of customers' patience on delay and abandonment: Some empirically-driven experiments with the M/M/n+G queue. OR Spektrum (2004) 26:377–411CrossrefGoogle Scholar
  • Puhalskii A. A., Reiman M. I. The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. Appl. Probob. (2000) 32:564–595CrossrefGoogle Scholar
  • Stone C. Limit theorems for random walks, birth and death processes and diffusion processes. Illinois J. Math. (1963) 4:638–660CrossrefGoogle Scholar
  • Ward A. R., Glynn P. W. A diffusion approximation for a Markovian queue with reneging. Queueing Systems (2003) 43:103–128CrossrefGoogle Scholar
  • Whitt W. A Review of L = W and Extensions. Queueing Systems (1991) 9:235–268CrossrefGoogle Scholar
  • Whitt W. Correction note on L = W. Queueing Systems (1992) 12:431–432CrossrefGoogle Scholar
  • Whitt W. Dynamic staffing in a telephone call center aiming to immediately answer all calls. Oper. Res. Lett. (1999) 24:205–212CrossrefGoogle Scholar
  • Whitt W.Stochastic-Process Limits (2002) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Whitt W. A diffusion approximation for the G/GI/n/m queue. Oper. Res. (2005a) . ForthcomingGoogle Scholar
  • Whitt W. Heavy-traffic limits for the G/H2*/n/m queue. Math. Oper. Res. (2005b) . ForthcomingLinkGoogle Scholar
  • Whitt W. Engineering solution of a basic call-center model. Management Sci. (2005c) . ForthcomingLinkGoogle Scholar
  • Whitt W. Fluid models for multiserver queues with abandonments. Oper. Res. (2005d) . ForthcomingGoogle Scholar
  • Whitt W. Two fluid approximations for multi-server queues with abandonments. Oper. Res. Lett. (2005e) . ForthcomingCrossrefGoogle Scholar
  • Zohar E., Mandelbaum A., Shimkin N. Adaptive behavior of impatient customers in tele-queues: Theory and empirical support. Management Sci. (2002) 48:566–583LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.