| Article ID: | iaor1999643 |
| Country: | Netherlands |
| Volume: | 94 |
| Issue: | 2 |
| Start Page Number: | 261 |
| End Page Number: | 270 |
| Publication Date: | Oct 1996 |
| Journal: | European Journal of Operational Research |
| Authors: | Bampis Evripidis, Guinand Frdric, Trystram Denis |
This paper is devoted to the study of tree-scheduling problems within the execution model described by Anderson, Beame and Ruzzo. We first prove the NP-completeness of the problem of minimizing the overhead for scheduling trees on