Scheduling Opposing Forests
- 1 March 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 4 (1) , 72-93
- https://doi.org/10.1137/0604011
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- An Almost-Linear Algorithm for Two-Processor SchedulingJournal of the ACM, 1982
- Scheduling Interval-Ordered TasksSIAM Journal on Computing, 1979
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Scheduling Graphs on Two ProcessorsSIAM Journal on Computing, 1976
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Erratum “Optimal Sequencing of Two Equivalent Processors”SIAM Journal on Applied Mathematics, 1971
- Optimal Sequencing of Two Equivalent ProcessorsSIAM Journal on Applied Mathematics, 1969