Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
From MaRDI portal
Publication:3798014
DOI10.1287/MNSC.34.8.959zbMath0652.60104OpenAlexW1991183139MaRDI QIDQ3798014
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
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (10)
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 ⋮ Service staffing with delay probabilities ⋮ Capacity expansion for a loss system with exponential demand growth. ⋮ Sharp and simple bounds for the Erlang delay and loss formulae ⋮ Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem ⋮ The evergreen Erlang loss function ⋮ A simple algebraic approximation to the Erlang loss system ⋮ 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
This page was built for publication: Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
