Sharp and simple bounds for the Erlang delay and loss formulae
From MaRDI portal
Publication:2268464
DOI10.1007/s11134-009-9152-7zbMath1182.90024MaRDI QIDQ2268464
Publication date: 8 March 2010
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-009-9152-7
60E15: Inequalities; stochastic orderings
90B50: Management decision making, including multiple objectives
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
90B30: Production models
Related Items
Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services, Optimality gap of asymptotically derived prescriptions in queueing systems, \(o(1)\)-optimality, Threshold properties of the \(M/M/1\) queue under T-policy with applications, On the Accuracy of the OPC Approximation for a Symmetric Overflow Loss Model
Cites Work
- Unnamed Item
- Unnamed Item
- The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
- Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime
- A simple algebraic approximation to the Erlang loss system
- On the Lambert \(w\) function
- A note on the convexity of performance measures of M/M/c queueing systems
- Convexity Properties of the Erlang Loss Formula
- Strong Convexity Results for Queueing Systems
- Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Note—Simple Inequalities for Multiserver Queues
- On the Inverse of Erlang's Function
- Some Properties of the Erlang Loss Function
- Asymptotic Inversion of the Erlang B Formula