In this paper, we consider the problem of scheduling tasks on unrelated parallel machines. Precedence constraints exist between the tasks, but their number is limited compared with the number of tasks. We propose a number of heuristics in order to find near-optimal solutions to the problem. Empirical results show that the heuristics are able to find very good approximate solutions.