An O(n3/(b+1)) time algorithm to obtain a minimum finish time schedule subject to tree-like precedence constraints for unit-time tasks on two uniform processors is obtained. It is assumed that the slower processor takes b time units for each one taken by the speedier one, for some integer b. It is also noted that a slight modification of this schedule yields a minimum mean flow time schedule.
