The Response Times of Priority Classes under Preemptive Resume in M/M/m Queues

DOI10.1287/OPRE.31.3.456zbMATH Open0514.90027OpenAlexW2126397656MaRDI QIDQ3661276FDOQ3661276

Authors J. P. Buzen, André B. Bondi 

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

zbMATH Keywords

approximate resultsmean response times formalesmultiserver M/M/m queuepreemptive resume scheduling

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited in

(14)

• When less is more: recovery technology investment and segmentation for uptime-centered services
• Delay performance in stochastic processing networks with priority service.
• 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
• An ME-based approximation for multi-server queues with preemptive priority
• 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
• \(M/M/c\) queue with two priority classes
• Multi-server queueing systems with multiple priority classes
• A maximum entropy priority approximation for a stable G/G/1 queue
• Management of a shared-spectrum network in wireless communications
• Unified and refined analysis of the response time and waiting time in the \(\mathrm{M}/\mathrm{M}/m\) FCFS preemptive-resume priority queue
• An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking
• Approximations for Markovian multi-class queues with preemptive 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)