HU'S PRECEDENCE TREE SCHEDULING ALGORITHM: A SIMPLE PROOF.

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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 languageEnglish (US)
Pages (from-to)409-411
Number of pages3
JournalNaval research logistics quarterly
Volume31
Issue number3
DOIs
StatePublished - Jan 1 1984

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'HU'S PRECEDENCE TREE SCHEDULING ALGORITHM: A SIMPLE PROOF.'. Together they form a unique fingerprint.

Cite this