Abstract
This paper is motivated by the observation that different methods to compute the weights of nodes and edges when scheduling DAGs onto heterogeneous machines may lead to signi.cant variations in the generated schedule. To minimize such variations, the paper presents a novel heuristic for DAG scheduling, which is based upon solving a series of independent task scheduling problems. A novel heuristic for the latter problem is also included in the paper. Both heuristics compare favourably with other related heuristics.