Scheduling of scientific workflows using Threshold accepting algorithm for Computational Grids

Grid computing environment involves all kind of resources namely network, software, data, storage and processing units, evolving towards Global computing to solve a single large problem using Grid scheduling architecture that addresses the interaction between the resource management and data management In this paper, two diferent approaches have been proposed to solve Grid scheduling problem with the objectives of maximizing the Job completion ratio (JCR) and minimizing the lateness. A population based evolutionary algorithm that involves evolution during the search process and a single point local search meta-heuristics that work on a single solution called as hybrid evolutionary algorithm. A Threshold accepting algorithm (TA) proposed is a single point local search meta-heuristic. Proposed algorithms are evaluated and the experimental results are presented for comparison.