First come first serve
Processes are executed as they arrive
Processes in the queue have to wait until the currently running process is executed
Shortest job first
Picks the shortest then executes it
Scheduler needs to know how long each will take
Round Robin
Each process is allotted a fixed amount of time to run
If the process has not finished by the end of the time, it is put at the back of the queue
Shortest remaining time
Same as shortest job first except processes can be suspended if a higher priority process enters the queue
Multi level feedback queues
Multiple queues possibly with different scheduling methods