Shortest Job First — optimal average waiting time. Add processes and see the SJF algorithm execute with animated Gantt chart.
Non-Preemptive ModeOptimal Avg WTAnimated Gantt
SJF Algorithm: The process with the shortest burst time executes next. Optimal for minimizing average waiting time but may cause starvation for longer processes.
Avg WT (SJF) ≤ Avg WT (any non-preemptive algorithm)