A Dynamic Priority Queue with General Concave Priority Functions

DOI10.1287/OPRE.27.6.1088MaRDI QIDQ3885480zbMATH OpenOpenAlexFDO

Authors A. Netterman, Igal Adiri

Publication date 1979

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.27.6.1088

zbMATH Keywords

lower boundsqueueing modelupper boundssingle serverFIFO ruleexpected waiting timepriority degreedynamic priority queuegeneral concave priority functions

Mathematics Subject Classification ID

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

Cited in

(8)

• A fluid model for one-sided bipartite matching queues with match-dependent rewards
• Heavy traffic response times for a priority queue with non-linear priorities.
• Priority queuing in an operating system
• On a general mixed priority queue with server discretion
• Waiting time distributions in the preemptive accumulating priority queue
• Lowest priority waiting time distribution in an accumulating priority Lévy queue
• Multiple finite source queueing model with dynamic priority scheduling
• Strategic bidding in an accumulating priority queue: equilibrium analysis

This page was built for publication: A Dynamic Priority Queue with General Concave Priority Functions

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