How Multiserver Queues Scale with Growing Congestion-Dependent Demand

References

• Armony M., Maglaras C. On customer contact centers with a call-back option: Customer decisions, sequencing rules, and system design. Oper. Res. (2003) 51To appearGoogle Scholar
• Billingsley P.Convergence of Probability Measures (1999) 2nd ed.(Wiley, New York) Crossref, Google Scholar
• Borst S., Mandelbaum A., Reiman M. I. Dimensioning large call centers. Oper. Res. (2003) . To appearGoogle Scholar
• Cooper R. B.Introduction to Queueing Theory (1982) 2nd ed.(North-Holland, Amsterdam, The Netherlands)Google Scholar
• Feller W.An Introduction to Probability and Its Applications (1971) II2nd ed.(Wiley, New York) Google Scholar
• Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial review and research prospects. Manufacturing Service Oper. Management (2003) 5To appearLink, Google Scholar
• Garnett O., Mandelbaum A., Reiman M. I. Designing a call center with impatient customers. Manufacturing Service Oper. Management (2002) 4:208–227Link, Google Scholar
• Glynn P. W., Whitt W. A new view of the heavy-traffic limit for infinite-server queues. Adv. Appl. Probab. (1991) 23:188–209Crossref, Google Scholar
• Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29:567–588Link, Google Scholar
• Hassin R., Haviv M. Equilibrium threshold strategies: The case of queues with priorities. Oper. Res. (1995) 45:966–973Link, Google Scholar
• Iglehart D. L. Limit diffusion approximations for the many-server queue and the repairman problem. J. Appl. Probab. (1965) 2:429–441Crossref, Google Scholar
• Mandelbaum A. Call centers (centres): Research bibliography with abstracts. (2001) . Faculty of Industrial Engineering and Management, The Technion, Haifa, IsraelGoogle Scholar
• Mandelbaum A., Pats G., Kelly F. P., Williams R. J. State-dependent queues: Approximations and applications. Stochastic Networks (1995) (IMA Volumes in Mathematics and Its Applications. Springer, New York) 239–282Crossref, Google Scholar
• Mandelbaum A., Shimkin N. A model for rational abandonments from invisible queues. Queueing Systems (2000) 36:141–173Crossref, Google Scholar
• Mendelson H., Whang S. Optimal incentive-compatible priority pricing for the M/M/1 queue. Oper. Res. (1990) 38:870–883Link, Google Scholar
• Puhalskii A., Reiman M. I. The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. Appl. Probab. (2000) 32:564–595Crossref, Google Scholar
• Smith D. R., Whitt W. Resource sharing for efficiency in traffic systems. Bell System Tech. J. (1981) 60:39–55Crossref, Google Scholar
• Stidham S. Optimal control of admission to a queueing system. IEEE Trans. Automatic Control (1985) 30:705–713Crossref, Google Scholar
• Whitt W. Comparing counting processes and queues. Adv. Appl. Probab. (1981) 13:207–220Crossref, Google Scholar
• Whitt W. Queues with service times and interarrival times depending linearly and randomly upon waiting times. Queueing Systems (1990) 6:335–351Crossref, Google Scholar
• Whitt W. Understanding the efficiency of multi-server service systems. Management Sci. (1992) 38:708–723Link, Google Scholar
• Whitt W. Dynamic staffing in a telephone call center aiming to immediately answer all calls. Oper. Res. Lett. (1999) 24:205–212Crossref, Google Scholar
• Whitt W.Stochastic-Process Limits (2002) (Springer, New York) Crossref, Google Scholar
• Whitt W. A diffusion approximation for the G/GI/n/m queue. Oper. Res. (2003) . To appearGoogle Scholar