The First$-$Come$-$First$-$Served $($FCFS$)$ scheduling algorithm is inherently non$-$preemptive; a preemptive FCFS algorithm would yield the same schedule as the one yielded by the non$-$preemptive FCFS$.$