Approximations for the waiting-time distribution in an M/PH/c priority queue
From MaRDI portal
Publication:2018118
DOI10.1007/S00291-015-0388-9zbMATH Open1311.90035DBLPjournals/ors/HanbaliAH15OpenAlexW1830826594WikidataQ59424978 ScholiaQ59424978MaRDI QIDQ2018118FDOQ2018118
Authors: Yanyan Li 
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
Recommendations
- AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE
- Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities.
- Multi-server queueing systems with multiple priority classes
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- Two-class M/PH, G/1 queue with impatience of high-priority customers
Cites Work
- A first course in stochastic models.
- Title not available (Why is that?)
- The Distributional Little's Law and Its Applications
- Title not available (Why is that?)
- Multi-server queueing systems with multiple priority classes
- Models and approximations for call center design
- Understanding the Efficiency of Multi-Server Service Systems
- Diffusion Approximation for an M/G/m Queue
- Title not available (Why is that?)
- Back to the roots of the M/D/s queue and the works of Erlang, Crommelin and Pollaczek
- Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
- Waiting and sojourn times in a multi-server queue with mixed priorities
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- Busy period analysis of the level dependent \(PH/PH/1/K\) queue
- Nonpreemptive Multi-Server Priority Queues
- An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
- The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
- Title not available (Why is that?)
- Time-limited polling systems with batch arrivals and~phase-type service times
- Analysis of mean values of a multi-server model with non-preemptive priorities and non-renewal input
- Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities.
Cited In (13)
- Waiting-time distribution of \(M/D_{N}/1\) queues through numerical Laplace inversion
- On an Approximation to the Mean Response Times of Priority Classes in a Stable G/G/c/PR Queue
- Interdeparture time distributions in \(\Sigma_{i}\text{M}_i\)/G\(_{i}\)/1 priority queues
- The waiting-time distribution and its moments of the PH/PH/1 queue
- High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs
- Waiting time distribution in a two-class two-server heterogeneous priority queue
- Waiting time distributions in the accumulating priority queue
- Title not available (Why is that?)
- Joint queue length distribution of multi-class, single-server queues with preemptive priorities
- Lowest priority waiting time distribution in an accumulating priority Lévy queue
- Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1
- Sojourn Time and Waiting Time Distributions for M/GI/1 Queues with Preemption-Distance Priorities
- Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
Uses Software
This page was built for publication: Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018118)
