“…Using the makespans of all grid resources computed in the previous step, the total makespan of the entire grid environment can be computed. Hence, a scheduling algorithm based on the Simulated Annealing (SA) metaheuristic is presented to find a good enough scheduling of jobs on resources with the aim of minimizing the total several related measures such as the total completion time of all jobs, expected waiting time of jobs, mean number of waiting grid jobs, expected sojourn time of jobs and so forth can be considered as performance measures [3,6,[8][9][10].…”