Multilevel Feedback Queue Scheduling: This allows to move a process one queue to another queue. First queue has lowest time slice, when it completed and process has more burts time then process moves its lower queue which has more(double approximately) queue. Its last queue works as FCFS (first come first serve).
Note: When a ready process waiting for CPU can be considered block because of indefinite block. FCFS, RR, HRRN and MLFQ process scheduling can not have starvation.