Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function

DOI10.1287/OPRE.33.6.1278zbMath0577.60098OpenAlexW2122085655MaRDI QIDQ3698044

Robert S. Sullivan, Uttarayan Bagchi

Publication date: 1985

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

single server queueing systemlinearly increasing priority disciplinessensitivity of the bounds to priority function parameters

Mathematics Subject Classification ID

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

Related Items (3)

Priority queuing in an operating system ⋮ Heavy traffic response times for a priority queue with non-linear priorities. ⋮ Waiting time distributions in the preemptive accumulating priority queue

This page was built for publication: Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function