a. First come first serve
As the name suggests, it schedules processes based on first come first serve. It is a non-preemptive algorithm.
b. Shortest job first
It is both preemptive as well as non-preemptive scheduling algorithm. In this algorithm, we give the highest priority to process with the lowest burst time. Its preemptive version is known as the Shortest job first algorithm.
c. Priority scheduling
It is both preemptive or non-preemptive. In this technique, we assign priority to every process and then execute in the priority order. It mostly uses a priority queue for execution.
d. Round-robin scheduling
In this algorithm, we assign a fixed time slot to each process. If the process does not execute completely in that time slot, it will complete its remaining execution in the next rounds. It is preemptive.
e. Multiple level queue schedule
This is also a priority-based algorithm. It maintains multiple queues for the processes with different priorities.
https://techvidvan.com/tutorials/greedy-algorithm/
