**GRASP algorithm**

In this approach a number of iterations are made to find the best possible mapping of jobs to resources for a given workflow Blythe et al. (2005). In each iteration, an initial allocation is constructed in a greedy phase. The initial allocation algorithm computes the tasks whose parents have already been scheduled on each pass, and consider every possible resource for each such task. A more detailed description about the algorithm can be seen in Quan (2007).
