Improving scheduling of scientific workflows using tabu search for computational grids

In this study, a scheduling procedure is proposed to evaluate a heuristic search algorithm, namely, Tabu Search (TS) for Grid Scheduling problem. In addition, two contradicting objectives of the Grid environment are aimed to achieve simultaneously by the scheduling mechanism. Further, the evaluation of other scheduling mechanisms namely First Come First Serve (FCFS), Last Come First Serve (LCFS) and Earliest Deadline First (EDF) are compared. In the experiments, we show the effectiveness of the TS method.