An Almost-Linear Algorithm for Two-Processor Scheduling
- 1 July 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (3) , 766-780
- https://doi.org/10.1145/322326.322335
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Worst Case Analysis of Two Scheduling AlgorithmsSIAM Journal on Computing, 1977
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Scheduling Graphs on Two ProcessorsSIAM Journal on Computing, 1976
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972