The authors consider the problem of optimally scheduling a set of jobs obeying in-tree precedence constraints when a number of processors is available. It is assumed that the service times of different jobs are independent identically distributed random variables.
Subject to a minor assumption on the service time distribution it is found that policies of the ”highest level first” type, although suboptimal, are optimal asymptotically, as the number of jobs tends to infinity.