Explicit results for the distributions of queue lengths for a non-preemptive two-level priority queue
From MaRDI portal
Publication:6644386
DOI10.1007/s10479-024-06237-5MaRDI QIDQ6644386
David Kirszenblat, Josef A. Zuk
Publication date: 27 November 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Recursive computation of steady-state probabilities in priority queues
- A distributional form of Little's law
- Scheduling for a multifunction phased array radar system
- Waiting times of a finite-capacity multi-server model with non-preemptive priorities
- Analysis of nonpreemptive priority queues with multiple servers and two priority classes
- Priority Queues
- Priority assignment on a waiting line
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- Waiting Time In a Multi-Server Cutoff-Priority Queue, and Its Application to an Urban Ambulance Service
- Computation of Steady-State Probabilities for M/M/1 Priority Queues
- Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue
- Fundamentals of Queueing Theory
- The Distributional Little's Law and Its Applications
- Waiting-Time Distribution of a Multi-Server, Priority Queuing System
- Priority Assignment in Waiting Line Problems
- Letter to the Editor—Waiting Line Subject to Priorities
- Letter to the Editor—Priority Assignment—A Correction
- State Probabilities of M/M/1 Priority Queues
This page was built for publication: Explicit results for the distributions of queue lengths for a non-preemptive two-level priority queue