Estimate of the quality of a method for all construction of a schedule for carrying out a set of operations in a sequence specified by a graph

The performance is estimated of a scheduling algorithm for which the priority of activities (graph vertices) is associated with the total weight of subordinate vertices.