Worst case analysis of Lawler's algorithm for scheduling trees with communication delays

This paper establishes the exact upper bound for Lawler's heuristic proving that its schedule of a UECT tree on m identical processors does not exceed an optimal solution by more than m/2 time units.