First Come, First Served (FCFS) is the simplest scheduling algorithm.
There is only one rule:
Let the initial process start when it is scheduled to and let it finish on its own. This scheduling technique is non-preemptive, which implies that only one process may be active at a time, regardless of how well it utilizes the system's resources, whether there is a waiting list for other processes, and regardless of the relative significance of those processes.
The algorithm is not commonly used because of these drawbacks, but it is included here as a benchmark against which to evaluate more straightforward techniques.
"Jobs are handled in the order in which they arrive at a machine or work center," according to the FCFS sequencing regulation.
Learn more about First Come, First Served:
brainly.com/question/1905493
#SPJ4
