Which CPU scheduling algorithm can cause 'starvation', where longer processes may wait indefinitely because shorter processes are continually given priority?

In Shortest Job First (SJF) scheduling, the CPU always selects the process with the smallest burst time next; if short processes keep arriving, a longer process can be repeatedly pushed back and may starve, waiting indefinitely. FCFS processes jobs strictly in arrival order, so no process is ever skipped. Round Robin gives every process a fair, fixed time slice in rotation, preventing starvation, and Priority Scheduling with Aging is specifically designed to prevent starvation by gradually raising the priority of waiting processes.