A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
- 27 November 1989
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 43 (2) , 225-230
- https://doi.org/10.1016/0377-2217(89)90216-6
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Efficient computation of optimal assignments for distributed tasksJournal of Parallel and Distributed Computing, 1987
- Load Balancing in Distributed SystemsIEEE Transactions on Software Engineering, 1982
- Heuristic Models of Task Assignment Scheduling in Distributed SystemsComputer, 1982