Profile Scheduling of Opposing Forests and Level Orders
- 1 October 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 6 (4), 665-687
- https://doi.org/10.1137/0606066
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Scheduling precedence graphs of bounded heightJournal of Algorithms, 1984
- Scheduling Opposing ForestsSIAM Journal on Algebraic Discrete Methods, 1983
- An Almost-Linear Algorithm for Two-Processor SchedulingJournal of the ACM, 1982
- A linear-time recognition algorithm for interval dagsInformation Processing Letters, 1981
- Scheduling Interval-Ordered TasksSIAM Journal on Computing, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Erratum “Optimal Sequencing of Two Equivalent Processors”SIAM Journal on Applied Mathematics, 1971
- Optimal Sequencing of Two Equivalent ProcessorsSIAM Journal on Applied Mathematics, 1969