Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas

Arie Harel
Additional contact information
Arie Harel: Graduate School of Management, Rutgers University, Newark, New Jersey 07102

Management Science, 1988, vol. 34, issue 8, 959-972

Abstract: Some sharp bounds and simple approximations are obtained for the Erlang delay formula and for the Erlang loss formula. One of the results is then used to get a simple analytical solution for the Server Allocation Problem.

Keywords: queues; Erlang delay formula; Erlang loss formula; inequalities; approximations; server allocation problem (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.34.8.959 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:34:y:1988:i:8:p:959-972

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().