The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
From MaRDI portal
Publication:3661276
DOI10.1287/OPRE.31.3.456zbMATH Open0514.90027OpenAlexW2126397656MaRDI QIDQ3661276FDOQ3661276
Publication date: 1983
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.31.3.456
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (14)
- An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking
- Delay performance in stochastic processing networks with priority service.
- M/M/c Queue with Two Priority Classes
- Multi-server queueing systems with multiple priority classes
- Management of a Shared-Spectrum Network in Wireless Communications
- Optimization of the number of maintenance crew in a manufacturing unit
- An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
- A maximum entropy priority approximation for a stable G/G/1 queue
- Approximations for Markovian multi-class queues with preemptive priorities.
- An ME-based approximation for multi-server queues with preemptive priority
- When less is more: recovery technology investment and segmentation for uptime-centered services
- Unified and refined analysis of the response time and waiting time in the \(\mathrm{M}/\mathrm{M}/m\) FCFS preemptive-resume priority queue
- 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
This page was built for publication: The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661276)