Improved genetic algorithm for independent tasks scheduling in grid
Zhong Yan-ping · Computer Engineering and Applications Journal · 2007
Presents a new hybrid genetic algorithm to solve the problem of independent tasks scheduling in grid.This algorithm expands the variety of population by adjusting the structure of the algorithm,and it also improves the local search ability by adding the adjusting operation.It has good global and local search ability,which can avoid premature convergence.The simulation results comparing with other scheduling algorithms show that it produces better results in terms of schedule length and it also has good convergent speed.