Heterogeneous earliest finish time

Heterogeneous earliest finish time (or HEFT) is a heuristic to schedule a set of dependent tasks onto a network of heterogenous workers taking communication time into account. For inputs HEFT takes a set of tasks, represented as a directed acyclic graph, a set of workers, the times to execute each task on each worker, and the times to communicate the results from each job to each of its children between each pair of workers. It descends from list scheduling algorithms.