Algorithm:
- Processes are added to a queue, ordered by (next) CPU burst time
- Picks the first process in the queue and executes it
- If multiple processes have the same CPU burst time, use FCFS among them
Details: - Fairly simple to implement
- Provable minimum average waiting time
- Unfortunately Unrealistic