Scheduling trees with large communication delays on two identical processors

We consider the problem of scheduling trees on two identical processors in order to minimize the makespan . We assume that tasks have unit execution times, and arcs are associated with large identical integer communication delays. We prove that the problem is NP-hard in the strong sense even when restricted to the class of binary trees , and we provide a polynomial-time algorithm for complete binary trees.