Algorithms for Scheduling Independent Tasks
- 1 January 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 23 (1), 116-127
- https://doi.org/10.1145/321921.321934
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975
- Computationally Related ProblemsSIAM Journal on Computing, 1974
- P-complete problems and approximate solutionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969