An N-Server Cutoff Priority Queue
From MaRDI portal
Publication:3753231
DOI10.1287/OPRE.34.2.257zbMATH Open0612.60089OpenAlexW2036950892MaRDI QIDQ3753231FDOQ3753231
Christian Schaack, Richard C. Larson
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.34.2.257
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (7)
- Delay performance in stochastic processing networks with priority service.
- Priority queues with semi-exhaustive service
- Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities.
- Analysis of \(M/M/1\) queueing system with two priority classes
- Incorporating priorities for waiting customers in the hypercube queuing model with application to an emergency medical service system in Brazil
- An N Server Cutoff Priority Queue Where Arriving Customers Request a Random Number of Servers
- A distributional form of Little's law
Recommendations
- An N Server Cutoff Priority Queue Where Arriving Customers Request a Random Number of Servers π π
- On a general mixed priority queue with server discretion π π
- Analyses of priority queues with server control π π
- Title not available (Why is that?) π π
- Priority queues with semi-exhaustive service π π
- Priority queues π π
- A finite buffer queue with priorities π π
- Bounded capacity priority queues π π
- Title not available (Why is that?) π π
This page was built for publication: An N-Server Cutoff Priority Queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753231)