One way of scheduling with graph-specified prediction

A scheduling algorithm is proposed where the priorities are dictated by the total weight of subordinate activities represented as graph nodes. For tree-like graphs the algorithm is proved optimal.