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