An Hybrid Evaluative Algorithm Applied to Task Scheduling

Since the task scheduling in grid computing faces a NP-hard problem, it leads very difficult to validate the methods of task scheduling. This paper combined with the advantages of two evaluative algorithms: genetic algorithm and simulated annealing, brings forward an hybrid evaluative algorithm and applied to solve task scheduling problem in grid computing. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing