Hu's precedence tree scheduling algorithm: A simple proof

DOI10.1002/NAV.3800310307MaRDI QIDQ3337929zbMATH OpenOpenAlexFDO

Authors James A. M. McHugh

Publication date 1984

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800310307

zbMATH Keywords

minimum timeprecedence tree constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online scheduling of equal-processing-time task systems
• scientific article; zbMATH DE number 3885638
• scientific article; zbMATH DE number 3900151
• Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
• Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints

Cited in

(5)

• Minimizing the number of machines for minimum length schedules
• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• scientific article; zbMATH DE number 3885638 (Why is no real title available?)
• Theory and methodology of time-dependent scheduling: past, present and future
• A state-of-the-art review of parallel-machine scheduling research

This page was built for publication: Hu's precedence tree scheduling algorithm: A simple proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337929)