Scheduling Interval-Ordered Tasks
- 1 August 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (3) , 405-409
- https://doi.org/10.1137/0208031
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Polynomial complete scheduling problemsACM SIGOPS Operating Systems Review, 1973
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal 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
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961