By Prof. Fazal Rehman Shamil
Last modified on August 27th, 2020
Shortest Job First Scheduling SJF Process Scheduling in operating systems.
The process with less burst time will always execute first.
Shortest job first scheduling is a non-preemptive scheduling algorithm so processes priority does not matter.
Preferred to minimize waiting time.
Better than First come first served scheduling.
Works only when the processor knows in advance that how much time every process will take to execute on CPU.
Not preferred for interactive systems because required CPU time is not already in knowledge.