Santhosh B, Dr. Manjaiah D.H
In this paper a unique modification to the Improved Max-min algorithm is proposed. In Improved Maxmin algorithm largest job is selected and assigned to the resource which gives minimum completion time. Here two algorithms are proposed on Improved Max-min where instead of selecting the largest task , a task just greater than average execution time is selected and assigned to the resource which gives minimum completion time. The experimental results shows the new algorithms schedules jobs with lower makespan .