Waiting and sojourn times in a multi-server queue with mixed priorities
DOI10.1007/S11134-009-9110-4zbMATH Open1165.90414OpenAlexW2094692686MaRDI QIDQ1029232FDOQ1029232
Segev Wasserkrug, Zohar Feldman, Sergey Zeltyn
Publication date: 10 July 2009
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-009-9110-4
Recommendations
- Analysis of mean values of a multi-server model with non-preemptive priorities and non-renewal input
- Waiting times of a finite-capacity multi-server model with non-preemptive priorities
- On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
- An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
- On a general mixed priority queue with server discretion
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Poisson Arrivals See Time Averages
- Title not available (Why is that?)
- A unified framework for numerically inverting Laplace transforms
- A Multiserver System with Preemptive Priorities
- Multi-server queueing systems with multiple priority classes
- Models and approximations for call center design
- Staffing of Time-Varying Queues to Achieve Time-Stable Performance
- Analysis of a non-preemptive priority multiserver queue
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- Waiting-Time Distribution of a Multi-Server, Priority Queuing System
- An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
- A Single Server Queueing System Working under Mixed Priority Disciplines
- Priority Queues with Feedback
- The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
- On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
- Threshold-based interventions to optimize performance in preemptive priority queues
- Approximations for Markovian multi-class queues with preemptive priorities.
- Queuing with Nonpreemptive and Preemptive-Resume Priorities
Cited In (11)
- Title not available (Why is that?)
- Analysis of a two-class single-server discrete-time FCFS queue: the effect of interclass correlation
- Class clustering destroys delay differentiation in priority queues
- MEAN SOJOURN TIMES IN A MULTI-STAGE TANDEM QUEUE SERVED BY A SINGLE SERVER
- Title not available (Why is that?)
- Unified and refined analysis of the response time and waiting time in the \(\mathrm{M}/\mathrm{M}/m\) FCFS preemptive-resume priority queue
- Waiting time in the \(\mathrm{M}/\mathrm{M}/m\) LCFS nonpreemptive priority queue with impatient customers
- Minimizing equilibrium expected sojourn time via performance-based mixed threshold demand allocation in a multiple-server queueing environment
- Analysis of a Markovian queue with customer interjections and finite buffer
- Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
- A note on sojourn times in queuing networks with multiserver nodes
This page was built for publication: Waiting and sojourn times in a multi-server queue with mixed priorities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029232)