A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems
IEEE Transactions on Computers
Genetic optimization of order scheduling with multiple uncertainties
Expert Systems with Applications: An International Journal
Scheduling trees onto hypercubes and grids is NP-complete
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 14.99 |
This paper considers a solution to the multiprocessor scheduling problem for the case where the ordering relation between tasks can be represented as a tree. Assume that we have n identical processors, and a number of tasks to perform. Each task Tirequires an amount of time µito complete, 0 i= k, so that k is an upper bound on task time. Tasks are indivisible, s