Author:
Leonardi Stefano,Raz Danny
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. N. Avrahami, Y. Azar, Minimizing total flow time and total completion time with immediate dispatching, in: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms, 2003, pp. 11–18
2. Minimizing the flow time without migration;Awerbuch;SIAM J. Comput.,2001
3. Introduction to Sequencing and Scheduling;Baker,1974
4. N. Bansal, K. Dhamdhere, Minimizing weighted flow time, in: Proceedings of the 14th Annual ACM–SIAM Symposium on Discrete Algorithms, 2003, pp. 508–516
5. Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines;Becchetti;J. ACM,2004
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献