Author:
Chekuri Chandra,Im Sungjin,Moseley Benjamin
Publisher
Theory of Computing Exchange
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-clairvoyantly Scheduling to Minimize Convex Functions;Algorithmica;2019-06-14
2. Rejecting jobs to minimize load and maximum flow-time;Journal of Computer and System Sciences;2018-02
3. Minimizing the maximum flow time in batch scheduling;Operations Research Letters;2016-11
4. Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11
5. Online batch scheduling for flow objectives;Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures;2013-07-23