A Diffusion Approximation for the G/GI/n/m Queue

Published Online:https://doi.org/10.1287/opre.1040.0136

References

  • Albin S. L. On Poisson approximations for superposition arrival processes in queues. Management Sci. (1982) 28:126–137LinkGoogle Scholar
  • Albin S. L. Approximating a point process by a renewal process, II: Superposition arrival processes. Oper. Res. (1984) 32:1133–1162LinkGoogle Scholar
  • Armony M., Maglaras C. On customer contact centers with a call-back option: Customer decisions, routing rules, and system design. Oper. Res. (2004) 52(2):271–292LinkGoogle Scholar
  • Asmussen S., Nerman O., Olsson M. Fitting phase type distributions via the EM algorithm. Scandanavian J. Statist. (1996) 23:419–441Google Scholar
  • Berger A. W., Whitt W. The Brownian approximation for rate-control throttles and the G/G/1/C queue. J. Discrete Event Dynam. Systems (1992a) 2:7–60CrossrefGoogle Scholar
  • Berger A. W., Whitt W. Comparisons of multi-server queues with finite waiting rooms. Stochastic Models (1992b) 8:719–732CrossrefGoogle Scholar
  • Billingsley P.Convergence of Probability Measures (1999) 2nd ed(Wiley, New York) CrossrefGoogle Scholar
  • Bolotin V., Labetoulle J., Roberts J. W. Telephone circuit holding-time distributions. Proc. Internat. Teletraffic Congress, ITC14 (1994) (North-Holland, Amsterdam, The Netherlands) 125–134CrossrefGoogle Scholar
  • Borovkov A. A.Stochastic Processes in Queueing Theory (1976) (Springer, New York) CrossrefGoogle Scholar
  • Borovkov A. A.Asymptotic Methods in Queueing Theory (1984) (Wiley, New York) Google Scholar
  • Borst S., Mandelbaum A., Reiman M. I. Dimensioning large call centers. Oper. Res. (2004) 52(1):17–34LinkGoogle Scholar
  • Brown L., Gans N., Mandelbaum A., Sakov A., Shen H., Zeltyn S., Zhao L. Statistical analysis of a telephone call center: A queueing-science perspective. (2002) (Department of Statistics, The Wharton School, University of Pennsylvania, Philadelphia, PA) Google Scholar
  • Browne S., Whitt W. Piecewise-linear diffusion processes. Advances in Queueing (1995) (CRC Press, Boca Raton, FL) 463–480Google Scholar
  • Eckberg A. E. Generalized peakedness of teletraffic processes. Proc. Tenth Internat. Teletraffic Congress (1983) Montreal, Quebec, CanadaGoogle Scholar
  • Eckberg A. E. Approximations for bursty (and smoothed) arrival queueing delays based on generalized peakedness. Proc. Eleventh Internat. Teletraffic Congress (1985) Kyoto, JapanGoogle Scholar
  • Feldmann A., Whitt W. Fitting mixtures of exponentials to long-tail distributions to analyze network performance models. Performance Evaluation (1998) 31:245–279CrossrefGoogle 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
  • Halachmi B., Franta W. R. A diffusion approximation to the multi-server queue. Management Sci. (1978) 24:522–529LinkGoogle Scholar
  • Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29:567–588LinkGoogle Scholar
  • Harrison J. M.Brownian Motion and Stochastic Flow Systems (1985) (Wiley, New York) Google Scholar
  • Hokstad P. Approximations for the M/G/m queue. Oper. Res. (1978) 26:510–523LinkGoogle Scholar
  • Jelenkovic P., Mandelbaum A., Momcilovic P. Heavy traffic limits for queues with many deterministic servers. Queueing Systems (2004) 47:53–69CrossrefGoogle Scholar
  • Jennings O. B., Mandelbaum A., Massey W. A., Whitt W. Server staffing to meet time-varying demand. Management Sci. (1996) 42:1383–1394LinkGoogle Scholar
  • Kimura T. An M/M/s-consistent diffusion model for the GI/G/s queue. Queueing Systems (1995) 19:377–397CrossrefGoogle Scholar
  • Kimura T. Equivalence relations in the approximations for the M/G/s/r queue. Math. Comput. Model. (2000) 31:215–224CrossrefGoogle Scholar
  • Kimura T. Diffusion approximations for queues with Markovian bases. Ann. Oper. Res. (2002) 113:27–40CrossrefGoogle Scholar
  • Mandelbaum A. Call centers (centres): Research bibliography with abstracts. (2001) . Faculty of Industrial Engineering and Management, Technion, Haifa, IsraelGoogle Scholar
  • Mandelbaum A., Schwartz R. Simulation experiments with M/G/100 queues in the Halfin-Whitt (Q.E.D.) regime. (2002) . Technical report, Technion, Haifa, IsraelGoogle Scholar
  • Massey W. A., Wallace R. B. An asymptotically optimal design of the M/M/c/k queue for call centers. Queueing Systems (2004) . ForthcomingGoogle Scholar
  • Newell G. F.Approximate Stochastic Behavior of n-Server Service Systems with Large n. Lecture Notes in Economics and Mathematical Systems (1973) (Springer, New York) . No. 87CrossrefGoogle Scholar
  • Nozaki S. A., Ross S. M. Approximations in finite-capacity multi-server queues with Poisson arrivals. J. Appl. Probab. (1978) 15:826–834CrossrefGoogle Scholar
  • Puhalskii A. A., Reiman M. I. The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. Appl. Probab. (2000) 32:564–595CrossrefGoogle Scholar
  • Seelen L. P., Tijms H. C., van Hoorn M. H.Tables for Multi-Server Queues (1985) (North-Holland, Amsterdam, The Netherlands) Google Scholar
  • Srikant R., Whitt W. Simulation run lengths to estimate blocking probabilities. ACM Trans. Model. Comput. Simulation (1996) 6:7–52CrossrefGoogle Scholar
  • Whitt W. Approximating a point process by a renewal process: Two basic methods. Oper. Res. (1982) 30:125–147LinkGoogle Scholar
  • Whitt W. Comparison conjectures about the M/G/s queue. Oper. Res. Lett. (1983) 2:203–210CrossrefGoogle Scholar
  • Whitt W. Heavy-traffic approximations for service systems with blocking. AT&T Bell Lab. Tech. J. (1984a) 63:689–708CrossrefGoogle Scholar
  • Whitt W. On approximations for queues, III: Mixtures of exponential distributions. AT&T Bell Lab. Tech. J. (1984b) 63:163–175CrossrefGoogle Scholar
  • Whitt W. Departures from a queue with many busy servers. Math. Oper. Res. (1984c) 9:534–544LinkGoogle Scholar
  • Whitt W. Understanding the efficiency of multi-server service systems. Management Sci. (1992) 38:708–723LinkGoogle Scholar
  • Whitt W. Approximations for the GI/G/m queue. Production Oper. Management (1993) 2:114–161CrossrefGoogle Scholar
  • Whitt W.Stochastic-Process Limits (2002) (Springer, New York) CrossrefGoogle Scholar
  • Whitt W. How multiserver queues scale with growing congestion-dependent demand. Oper. Res. (2003) 51:531–542LinkGoogle Scholar
  • Whitt W. Heavy-traffic limits for loss proportions in single-server queues. Queueing Systems (2004) 46:507–536CrossrefGoogle Scholar
  • Whitt W.Math Oper. Res. (2005) . ForthcomingGoogle 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.