Using multi-level feedback queues eliminates process starvation.

Multi-level feedback queues implement a dynamic priority system.

Round Robin is a starvation-free scheduling algorithm.

Using static priorities for scheduling, and ensuring that always a higher priority process is served before any lower priority processes, is always a fair scheduling method and does not entail the danger of process starvation.

In preemptive scheduling, it makes sense to make the quantum time (q) very short (e.g. 1 msec). In this way the CPU will more rapidly swap between processes and the illusion of "many things happening at the same time" will be even stronger.

In non-preemptive scheduling (such as FCFS) it is possible that a process may occupy the CPU until it finishes completing, no matter how long this may take.