A Dynamic Priority Queue with General Concave Priority Functions
From MaRDI portal
Publication:3885480
DOI10.1287/opre.27.6.1088zbMath0442.90026OpenAlexW2043758257MaRDI QIDQ3885480
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
upper boundslower boundsqueueing modelsingle serverFIFO ruleexpected waiting timepriority degreedynamic priority queuegeneral concave priority functions
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards, Priority queuing in an operating system, Multiple finite source queueing model with dynamic priority scheduling, Lowest priority waiting time distribution in an accumulating priority Lévy queue, Heavy traffic response times for a priority queue with non-linear priorities., Strategic bidding in an accumulating priority queue: equilibrium analysis, Waiting time distributions in the preemptive accumulating priority queue, On a general mixed priority queue with server discretion