Worst Case Analysis of Two Scheduling Algorithms
- 1 September 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (3), 518-536
- https://doi.org/10.1137/0206037
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- On a class of scheduling algorithms for multiprocessors computing systemsLecture Notes in Computer Science, 1975
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,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
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961