Hu's precedence tree scheduling algorithm: A simple proof
From MaRDI portal
Publication:3337929
DOI10.1002/nav.3800310307zbMath0546.90046OpenAlexW1993030812MaRDI QIDQ3337929
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
Related Items (3)
A backward approach in list scheduling algorithms for multi-machine tardiness problems ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ Minimizing the number of machines for minimum length schedules
This page was built for publication: Hu's precedence tree scheduling algorithm: A simple proof