FCFS CPU SCHEDULING ALGORITHM
no vote
First-Come, First-Served Scheduling
By far the simplest CPU-scheduling algorithm is the first-come, first-served (FCFS) scheduling algorithm. With this algorithm, processes are assigned the CPU in the order they request it.
Basically, there is a single queue of ready processes. Relative importance of jobs measured only by arrival time (poor choice).
The implementation of the FCFS policy is easily managed with a FIFO queue. When a process enters the ready queue, its PCB is linked onto the tail of the queue.