Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
From MaRDI portal
Publication:3798014
DOI10.1287/MNSC.34.8.959zbMATH Open0652.60104OpenAlexW1991183139MaRDI QIDQ3798014FDOQ3798014
Authors: Arie Harel 
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.8.959
Recommendations
- Sharp and simple bounds for the Erlang delay and loss formulae
- On a bicriterion server allocation problem in a multidimensional Erlang loss system
- A simple algebraic approximation to the Erlang loss system
- A simple approximation for the Erlang loss function
- Some allocation problems for critically loaded loss systems with independent links
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (13)
- Service staffing with delay probabilities
- Capacity expansion for a loss system with exponential demand growth.
- Optimality gap of asymptotically derived prescriptions in queueing systems, \(o(1)\)-optimality
- The evergreen Erlang loss function
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem
- Asymptotic inversion of the Erlang B formula
- Threshold properties of the \(M/M/1\) queue under T-policy with applications
- A simple algebraic approximation to the Erlang loss system
- On product form approximations for communication networks with losses: Error bounds
- Second-order properties of the loss probability in \(M/M/s/s+c\) systems
- Some properties of the delay probability in \(M/M/s/s+c\) systems
- Allocation of Servers for Stochastic Service Stations with One Overflow Station
- Sharp and simple bounds for the Erlang delay and loss formulae
This page was built for publication: Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798014)
