Independent Tasks Scheduling Algorithm Based on Dynamic Fit Degree

After analyzing the advantages and disadvantages of the scheduling heuristics in the literature, in order to get better load balance and schedule more tasks to its more suitable machines at the same time, a new scheduling algorithm based on Dynamic Fit Degree (DFD) was put forward. The suitability of the machine with minimum time for finishing the task was described by task´s DFD schema. The proposed algorithm used DFD as the priority, and the task with biggest DFD was scheduled first in each step. The simulation results compared with other scheduling algorithms show that the proposed algorithm produces better results.