NP-complete scheduling problems
- 1 June 1975
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 10 (3), 384-393
- https://doi.org/10.1016/s0022-0000(75)80008-0
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (GJ 35570, GJ 474)
This publication has 5 references indexed in Scilit:
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Scheduling independent tasks to reduce mean finishing-time (extended abstract)ACM SIGOPS Operating Systems Review, 1973
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Optimal Sequencing of Two Equivalent ProcessorsSIAM Journal on Applied Mathematics, 1969