A simple algebraic approximation to the Erlang loss system
From MaRDI portal
Publication:1003502
DOI10.1016/J.ORL.2007.10.010zbMATH Open1158.60375OpenAlexW2027476515MaRDI QIDQ1003502FDOQ1003502
Authors: Daniel Adelman 
Publication date: 4 March 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2007.10.010
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
- Title not available (Why is that?)
- Price-Directed Control of a Closed Logistics Queueing Network
- Title not available (Why is that?)
- Capacity Management in Rental Businesses with Two Customer Bases
- Note—Simple Inequalities for Multiserver Queues
- Note—Comments on a Queueing Inequality
Cited In (11)
- Convexity Properties of the Erlang Loss Formula
- Title not available (Why is that?)
- Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
- Improved approximations for the Erlang loss model
- The evergreen Erlang loss function
- HITTING TIME IN AN ERLANG LOSS SYSTEM
- On the continued Erlang loss function
- Performance optimization of open zero-buffer multi-server queueing networks
- Erlang loss bounds for OT-ICU systems
- Sharp and simple bounds for the Erlang delay and loss formulae
- A simple approximation for the Erlang loss function
This page was built for publication: A simple algebraic approximation to the Erlang loss system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003502)
