Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline

DOI10.1287/OPRE.26.1.197zbMATH Open0373.60124OpenAlexW2030311589MaRDI QIDQ4150997FDOQ4150997

Authors: Donald R. Smith 

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

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Cited In (18)

• Local edge minimality of SRPT networks with shared resources
• SRPT applied to bandwidth-sharing networks
• Performance of non-cooperative routing over parallel non-observable queues
• Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
• Minimizing the mean slowdown in the M/G/1 queue
• Monotonicity properties for multi-class queueing systems
• On the Gittins index in the M/G/1 queue
• On competitive analysis for polling systems
• Fluid limits for shortest job first with aging
• Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
• SPT is optimally competitive for uniprocessor flow
• Fluid limits for multiple-input shortest remaining processing time queues
• Diffusion limits for shortest remaining processing time queues
• Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions
• On the Gittins index for multistage jobs
• Title not available (Why is that?)
• Scheduling problems in master-slave model

This page was built for publication: Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline

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