Shortest remaining time

In this scheduling algorithm, the process with the smallest amount of time remaining until completion is selected to execute.

Shortest remaining time is advantageous because short processes are handled very quickly.

[1] This threat can be minimal when process times follow a heavy-tailed distribution.

[2] A similar algorithm which avoids starvation at the cost of higher tracking overhead is highest response ratio next (HRRN).

Like shortest job next scheduling, shortest remaining time scheduling is rarely used outside of specialized environments because it requires accurate estimates of the runtime of each process.