Analyzing service blueprints using phase distributions
From MaRDI portal
Publication:1266574
DOI10.1016/0377-2217(94)00157-XzbMath0913.90102OpenAlexW2011087279MaRDI QIDQ1266574
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00157-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A graphical investigation of error bounds for moment-based queueing approximations
- On Approximations for Queues, I: Extremal Distributions
- On Approximations for Queues, II: Shape Constraints
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- The least variable phase type distribution is erlang
- Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Explicit Steady-State Solutions to Some Elementary Queueing Models
- Matching moments to phase distributions: Mixtures of erlang distributions of common order
This page was built for publication: Analyzing service blueprints using phase distributions