References

• 1968Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline562 cited
• 2000A Practical Guide to Heavy Tails451 cited
• 1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline342 cited
• 2001Analysis of SRPT scheduling312 cited
• 2003Classifying scheduling policies with respect to unfairness in an M/GI/1170 cited
• 2004On measuring fairness in queues96 cited
• 2002Asymptotic convergence of scheduling policies with respect to slowdown87 cited
• 2004A resource-allocation queueing fairness measure82 cited
• 2003Fairness and efficiency in web server protocols72 cited
• 1978Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline69 cited
• 2004Size-based scheduling policies with inaccurate scheduling information54 cited
• 1990The steady-state appearance of the M / G /1 queue under the discipline of shortest remaining processing time27 cited
• 2004Quantifying the properties of SRPT scheduling25 cited
• 2004Simulation evaluation of hybrid srpt scheduling policies22 cited
• 1993The variance of delay time in queueing system M/G/1 with optimal strategy SRPT