Hu's precedence tree scheduling algorithm: A simple proof

James A. M. McHugh

Naval Research Logistics Quarterly, 1984, vol. 31, issue 3, 409-411

Abstract: This article presents a simple proof of Hu's algorithm for scheduling in minimum time a set of tasks constrained by precedence tree constraints, each task requiring a unit time to complete, and where m processors are available.

Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800310307

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:31:y:1984:i:3:p:409-411

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().