Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
From MaRDI portal
Publication:2018118
DOI10.1007/s00291-015-0388-9zbMath1311.90035OpenAlexW1830826594WikidataQ59424978 ScholiaQ59424978MaRDI QIDQ2018118
Publication date: 10 April 2015
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-015-0388-9
Related Items (2)
Joint queue length distribution of multi-class, single-server queues with preemptive priorities ⋮ Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Busy period analysis of the level dependent \(PH/PH/1/K\) queue
- Multi-server queueing systems with multiple priority classes
- Waiting and sojourn times in a multi-server queue with mixed priorities
- Models and approximations for call center design
- Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities.
- Time-limited polling systems with batch arrivals and~phase-type service times
- Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
- An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
- Analysis of mean values of a multi-server model with non-preemptive priorities and non-renewal input
- Back to the roots of the M/D/s queue and the works of Erlang, Crommelin and Pollaczek
- The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- Nonpreemptive Multi-Server Priority Queues
- Understanding the Efficiency of Multi-Server Service Systems
- Diffusion Approximation for an M/G/m Queue
- The Distributional Little's Law and Its Applications
This page was built for publication: Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
