Scheduling According to the Shortest Remaining ProcessingTime (SRPT) Rule

Professor Clifford Stein

ABSTRACT

The shortest remaining processing time (SRPT) rule is a natural and often used rule in scheduling. According to this rule, one should always be scheduling the job(s) which are closest to finishing. In this talk, we will look at several different scheduling environments and analyze how well the SRPT rule performs, and try to give insight into when and why it performs well. We will survey some older results and describe new results on parallel machines with release dates, and in environments when machines can break down.