In a nutshell
A computer's CPU can run only one program at a time, so when several are waiting, a scheduling policy decides who goes next. First-Come First-Served runs them in arrival order; Shortest Job First runs the quickest one first to cut average waiting; Round-Robin gives each a small fixed time slice and rotates so everyone stays responsive. The choice is always a trade-off between speed, fairness, and responsiveness.