An approximation algorithm for scheduling trees of malleable tasks
- 16 October 2002
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 142 (2) , 242-249
- https://doi.org/10.1016/s0377-2217(02)00264-3
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- A Strip-Packing Algorithm with Absolute Performance Bound 2SIAM Journal on Computing, 1997
- LogPCommunications of the ACM, 1996
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966