Feedback scheduling is a kind of process scheduling mechanism where process doesn't come with any priority. According to the CPU burst needed by the process and the CPU burst remaining the processes are shifted between queues of the feedback scheduler to get completed. In multilevel feedback queue the total architecture is divided into multiple prioritised queues. In this paper, we give an approach for jobs which starve in the lower priority queue for long time to get CPU cycle. As a result response time of those starved processes decreases eight to ten percent and over all turn around time of the whole scheduling process decreases around eight to ten percents. In comparison to other types of MLFQs the performance of the proposed scheduling technique is better and practical according to the consequence.