Nonpreemptive scheduling of independent tasks with prespecified processor allocations
- 1 December 1994
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 41 (7) , 959-971
- https://doi.org/10.1002/1520-6750(199412)41:7<959::aid-nav3220410708>3.0.co;2-k
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Scheduling preemptive multiprocessor tasks on dedicated processorsPerformance Evaluation, 1994
- Scheduling multiprocessor tasks on three dedicated processorsInformation Processing Letters, 1992
- NP-completeness of edge-colouring some restricted graphsDiscrete Applied Mathematics, 1991
- Multiprocessor scheduling with communication delaysParallel Computing, 1990
- The complexity of scheduling independent two-processor tasks on dedicated processorsInformation Processing Letters, 1987
- Comparability GraphsPublished by Springer Nature ,1985
- A Fast Algorithm for the Decomposition of Graphs and PosetsMathematics of Operations Research, 1983
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling ProblemA I I E Transactions, 1970
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967