Algorithm:
- Pre-emptive version of SJF
- Processes are added to a queue, ordered by remaining CPU burst time
- Scheduler is also called when new processes arrive
- 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 wait time