The concern of reducing power consumption and the schedule length (or makespan) has added new levels of complexities to the scheduling of task graphs on multiprocessors. Recent researches in the field have obtained ...

Duplication has proved to be a vital technique for scheduling task graphs on a network of unrelated parallel machines. Few attempts have been made to model duplication in a Mixed Integer Linear Program (MILP) to reduce ...