Scheduling precedence graphs of bounded height
- 31 March 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (1) , 48-59
- https://doi.org/10.1016/0196-6774(84)90039-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An Almost-Linear Algorithm for Two-Processor SchedulingJournal of the ACM, 1982
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Optimal scheduling for two-processor systemsActa Informatica, 1972