Efficient and Reliable Computation of Birth-Death Process Performance Measures
From MaRDI portal
Publication:2815427
DOI10.1287/ijoc.1100.0435zbMath1465.60079OpenAlexW1969556115MaRDI QIDQ2815427
Publication date: 29 June 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2c0116ba2c9de1f91bee962b5366bff1e762a111
Queues and service in operations research (90B22) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items
Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes ⋮ Modeling Load and Overwork Effects in Queueing Systems with Adaptive Service Rates
Cites Work
- Markov chain models of a telephone call center with call blending
- Calculation of steady-state probabilities of M/M queues: Further approaches
- BOUNDS ON TAIL PROBABILITIES OF DISCRETE DISTRIBUTIONS
- Engineering Solution of a Basic Call-Center Model
- The Classification of Birth and Death Processes
- Stochastic monotonicity of birth–death processes
- Some Properties of the Erlang Loss Function
- A formula for tail probabilities of Cox distributions
