Shortest Time to Completion First CPU Scheduling
In this video, I discuss Shortest Time to Completion First CPU Scheduling, which is very much like Shortest Job First, but with preemptive scheduling decisions allowed anytime a new process arrives, if that new process would have a shorter CPU burst time than the process currently on the CPU has remaining.
