Abstract
This article presents a simple proof of T. C. Hu's algorithm for scheduling in minimum time a set of tasks constrained by precedence tree constraints. Each task requires a unit time to complete, and where m processors are available. Hu established optimality by proving the algorithm attains an a priori lower bound on the scheduling time, and so must be minimum. The article recapitulates Hu's lower bounds, but provides a much simpler proof that Hu's algorithm attains these bounds.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 409-411 |
| Number of pages | 3 |
| Journal | Naval Research Logistics Quarterly |
| Volume | 31 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1984 |
All Science Journal Classification (ASJC) codes
- General Engineering