Author:
Ambühl Christoph,Mastrolilli Monaldo
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference12 articles.
1. B. Awerbuch, Y. Azar, S. Leonardi, O. Regev, Minimizing the flow time without migration, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC’99), 1999, pp. 198–205.
2. M.A. Bender, S. Chakrabarti, S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98), 1998, pp. 270–279.
3. B. Chen, C. Potts, G. Woeginger, A review of machine scheduling: complexity, algorithms and approximability, Handbook of Combinatorial Optimization, vol. 3, 1998, pp. 21–169.
4. An optimal algorithm for preemptive on-line scheduling;Chen;Oper. Res. Lett.,1995
5. Scheduling algorithms;Karger,1997
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scheduling Out-Trees Online to Optimize Maximum Flow;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. A scheduling framework for distributed key-value stores and its application to tail latency minimization;Journal of Scheduling;2024-02-26
3. Bounding the Flow Time in Online Scheduling with Structured Processing Sets;2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2022-05
4. Scheduling Flows on a Switch to Optimize Response Times;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
5. Rejecting jobs to minimize load and maximum flow-time;Journal of Computer and System Sciences;2018-02