Stochastic Online Scheduling on Unrelated Machines-Reference-Cited by-同舟云学术

Stochastic Online Scheduling on Unrelated Machines

Published:2017 Issue: Volume: Page:228-240
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Gupta Varun,Moseley Benjamin,Uetz Marc,Xie Qiaomin

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-59250-3_19

Reference35 articles.

1. Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1228–1241 (2012)

2. Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: Proceedings of the 15th Symposium on Parallelism in Algorithms and Architectures (SPAA 2003), pp. 11–18. ACM (2003)

3. Balseiro, S., Brown, D., Chen, C.: Static routing in stochastic scheduling: Performance guarantees and asymptotic optimality. Technical report (2016)

4. Bansal, N., Srinivasan, A., Svensson, O.: Lift-and-round to improve weighted completion time on unrelated machines. In: Proceedings of 48th Annual ACM Symposium Theory Computing (STOC), pp. 156–167. ACM (2016)

5. Becchetti, L., Leonardi, S.: Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. In: STOC, pp. 94–103 (2001)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The efficiency-fairness balance of Round Robin scheduling;Operations Research Letters;2022-01

2. Performance of the Smallest-Variance-First Rule in Appointment Sequencing;Operations Research;2021-11

3. Stochastic Load Balancing on Unrelated Machines;Mathematics of Operations Research;2021-02

4. Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines;Computers & Operations Research;2021-01

5. Optimal Resource Allocation for Elastic and Inelastic Jobs;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06