Mixing of non-preemptive and preemptive repeat priority disciplines

DOI10.1016/0377-2217(84)90266-2zbMath0543.90046OpenAlexW1984617688MaRDI QIDQ796442

I. Domb, Igal Adiri

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90266-2

zbMATH Keywords

waiting timepreemptive prioritysingle servernon-preemptive priorityFIFO rulehomogeneous Poisson arrival processmany priority classesmixed priority queuesrepeat disciplinessteady-state Laplace-Stieltjes transforms

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Probabilistic methods, stochastic differential equations (65C99)

Related Items (2)

\(T\)-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks ⋮ On a general mixed priority queue with server discretion

Cites Work

• Unnamed Item
• A Single Server Queueing System Working under Mixed Priority Disciplines
• Poisson Arrivals See Time Averages

This page was built for publication: Mixing of non-preemptive and preemptive repeat priority disciplines