Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
From MaRDI portal
Publication:4150997
DOI10.1287/OPRE.26.1.197zbMath0373.60124OpenAlexW2030311589MaRDI QIDQ4150997
Publication date: 1978
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.26.1.197
Related Items (18)
SRPT applied to bandwidth-sharing networks ⋮ Diffusion limits for shortest remaining processing time queues ⋮ Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues ⋮ SPT is optimally competitive for uniprocessor flow ⋮ Fluid limits for shortest job first with aging ⋮ Monotonicity properties for multi-class queueing systems ⋮ Minimizing the mean slowdown in the M/G/1 queue ⋮ On competitive analysis for polling systems ⋮ Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling ⋮ PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES ⋮ Unnamed Item ⋮ Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines ⋮ Scheduling problems in master-slave model ⋮ On the Gittins index in the M/G/1 queue ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions ⋮ On the Gittins index for multistage jobs ⋮ Local edge minimality of SRPT networks with shared resources
This page was built for publication: Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
