Shortest Job First
← Back to Scheduling Algorithms
Schedules the process with the shortest expected execution time next. Optimal for minimizing average waiting time, but requires knowing job lengths in advance (which is often impractical). Preemptive variant is called Shortest Remaining Time First (SRTF).