Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Lepère, R., Trystram, D., Woeginger, G.J.: Approximation algorithms for scheduling malleable tasks under precedence constraints. Int. J. Found. Comput. Sci. 13(4), 613–627 (2002)
2. Lecture Notes in Computer Science;K. Jansen,2005
3. Skutella, M.: Approximation algorithms for the discrete time-cost tradeoff problem. Technical Report 514/1996, Technische Universität Berlin (1996)
4. Du, J., Leung, J.Y.T.: Complexity of scheduling parallel task systems. SIAM J. Disc. Math. 2(4), 473–487 (1989)
5. Turek, J., Wolf, J.L., Yu, P.S.: Approximate algorithms scheduling parallelizable tasks. In: Proceedings of SPAA 1992, pp. 323–332 (1992)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献