Convexity Results for the Erlang Delay and Loss Formulae When the Server Utilization Is Held Constant

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

References

  • Bassamboo A., Randhawa R. S., Van Mieghem J. A. A little flexibility is all you need: On the value of flexible resources in queuing systems. (2009) . Manuscript, Northwestern University, Evanston, IL. Accessed June 2009, http://www.kellogg.northwestern.edu/faculty/vanmieghem/Google Scholar
  • Benjaafar S. Performance bounds for the effectiveness of pooling in multi-processing systems. Eur. J. Oper. Res. (1995) 87(2):375–388CrossrefGoogle Scholar
  • Calabrese J. M. Optimal workload allocation in open networks of multiserver queues. Management Sci. (1992) 38(12):1792–1802LinkGoogle Scholar
  • Daley D. J., Rolski T. Some comparability results for waiting-times in single-server and many-server queues. J. Appl. Probab. (1984) 21(4):887–900CrossrefGoogle Scholar
  • Flajolet P., Grabner P. J., Kirschenhofer P., Prodinger H. On Ramanujan's Q-function. J. Comput. Appl. Math. (1995) 58(1):103–116CrossrefGoogle Scholar
  • Harel A. Sharp bounds and simple approximations for the Erlang delay and loss formulas. Management Sci. (1988) 34(8):959–972LinkGoogle Scholar
  • Harel A. Convexity properties of the Erlang loss formula. Oper. Res. (1990) 38(3):499–505LinkGoogle Scholar
  • Harel A. Sharp and simple bounds for the Erlang delay and loss formulae. Queueing Systems (2010) 64(2):119–143CrossrefGoogle Scholar
  • Harel A., Zipkin P. Strong convexity results for queueing systems. Oper. Res. (1987) 35(3):405–418LinkGoogle Scholar
  • Ramanujan S.Collected Papers (1927) (Cambridge University Press, Cambridge, UK) . Reprinted by Chelsea, New York, 1962; reprinted by Narosa, New Delhi, India, 1987; reprinted by the American Mathematical Society, Providence, RI, 2000Google Scholar
  • Seshadri S. A sample path analysis of the delay in the M/G/C system. J. Appl. Probab. (1996) 33(1):256–266CrossrefGoogle Scholar
  • Smith D. R., Whitt W. Resource sharing for efficiency in traffic systems. Bell System Tech. J. (1981) 60(1):39–55CrossrefGoogle Scholar
  • Tekin E., Hopp W. J., Van Oyen M. P. Pooling strategies for call center agent cross-training. IIE Trans. (2009) 41(6):546–561CrossrefGoogle Scholar
  • Whitt W. The Erlang B and C formulas: Problems and solutions. (2002) . Class notes. http://www.columbia.edu/~ww2040/ErlangBandC-Formulas.pdfGoogle Scholar
  • Wolff R. W.Stochastic Modeling and the Theory of Queues (1989) (Prentice Hall, Englewood Cliffs, NJ) Google 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.