Abstract
We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length tasks with a forest of intrees as precedence relation, and with unit interprocessor communication delays. First, we prove that this problem is NP-complete; second, we derive a linear time algorithm for the special case that m equals 2.
Original language | English |
---|---|
Pages (from-to) | 157-173 |
Number of pages | 17 |
Journal | Journal of Algorithms |
Volume | 20 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1996 |