Complexity of scheduling multiprocessor tasks with prespecified processor allocations
- 1 December 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 55 (3) , 259-272
- https://doi.org/10.1016/0166-218x(94)90012-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Scheduling multiprocessor tasks on three dedicated processorsInformation Processing Letters, 1992
- Multiprocessor scheduling with communication delaysParallel Computing, 1990
- The complexity of scheduling independent two-processor tasks on dedicated processorsInformation Processing Letters, 1987
- Scheduling Multiprocessor Tasks to Minimize Schedule LengthIEEE Transactions on Computers, 1986
- An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer SystemsIEEE Transactions on Computers, 1985
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling ProblemA I I E Transactions, 1970