A Random Family of Queueing Systems with a Dynamic Priority Discipline

DOI10.1287/MOOR.10.1.24MaRDI QIDQ3681698zbMATH OpenOpenAlexFDO

Authors N. U. Prabhu, Paul K. Reeser

Publication date 1985

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.10.1.24

zbMATH Keywords

dynamic prioritiesStochastic orderingsvirtual waiting time processes

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• The stationary waiting time process in single-server priority queues with general low priority arrival process
• Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function
• scientific article; zbMATH DE number 4030673
• Analysis of a dynamic priority queue
• scientific article; zbMATH DE number 4117618

Cited in

(13)

• Dynamic sorting of calls in systems with limited sojourn time
• On the M₂/G/_2/1/ queue with relative dynamic priorities
• Priority queuing in an operating system
• A method for solving stationary equations for priority time-sharing service process in random environment
• Queueing system with two input flows, preemptive priority, and stochastic dropping
• A first passage time problem for spectrally positive Lévy processes and its application to a dynamic priority queue
• The stationary waiting time process in single-server priority queues with general low priority arrival process
• scientific article; zbMATH DE number 4217197 (Why is no real title available?)
• scientific article; zbMATH DE number 5007210 (Why is no real title available?)
• scientific article; zbMATH DE number 4078458 (Why is no real title available?)
• scientific article; zbMATH DE number 4117618 (Why is no real title available?)
• Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes
• Inequalities for queues with a learning server

This page was built for publication: A Random Family of Queueing Systems with a Dynamic Priority Discipline

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3681698)