The scheduler needs a rule for picking the next process, and the simplest rules are arrival order (FCFS) or shortest burst first (SJF). FCFS is easy but one long job can hold up many short ones, the convoy effect. SJF fixes that and gives the lowest average waiting time among non-preemptive algorithms, but it needs burst times in advance and can starve long jobs. Expect both in nearly every scheduling numerical.