Soraj and Roy [12] This paper gives the better
result comparison to Simple Round Robin
Scheduling Algorithm and solves the problem of
shortest job first scheduling algorithm which is
starvation. This approach also solves the problem
higher average waiting time of first come first
serve scheduling algorithm. The result performance
I had shown in the performance chart above. The performance in the reference of average waiting
time, turnaround time and context switches. For the
future perspective the research should be useful
with the knowing of arrival time with burst time
and you can analysis this research for
improvement.