First Come First Serve

Shortest Job First

Priority Queue

Nonpreemptive policy in which the process with the shortest expected processing time is
selected next

A short process will jump to the head of the queue

Possibility of starvation for longer processes

One difficulty is the need to know, or at least estimate, the required processing time of each
process

If the programmer’s estimate is substantially under the actual running time, the system may
abort the job
--------

In this process, we are concerned with figuring out which process has the shortest expected
processing time remaining. (image of processes stating how long they will take)

Figuring out which process will take the shortest time however, is not exactly easy. In these
cases, the execution time must be figured out manually (Processes question mark shows)

If the time given is shorter than the time required, the process may be aborted.

The process chosen to have the shortest execution time will immediately jump to the head of
the queue. (process skipping to head of queue)

This is a relatively simple process, and it minimizes the time it takes for each process to
complete.

However, there are cases of process starvation in this scheduling method. This can occur
when the process is waiting for a resource in which another process (that is waiting for
execution) is currently using. (processes ask for resource, being used by another)