Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling

Published:2020-05 Issue:2 Volume:45 Page:497-516
ISSN:0364-765X
Container-title:Mathematics of Operations Research
language:en
Short-container-title:Mathematics of OR

Author:

Gupta Varun¹^ORCID,Moseley Benjamin²^ORCID,Uetz Marc³^ORCID,Xie Qiaomin⁴^ORCID

Affiliation:

1. Booth School of Business, University of Chicago, Chicago, Illinois 60637;

2. Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213

3. Department of Applied Mathematics, University of Twente, 7522 NB Enschede, Netherlands

4. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Reference41 articles.

1. Anand S, Garg N, Kumar A (2012) Resource augmentation for weighted flow-time explained by dual fitting. Rabani Y, ed.Proc.23rd Annual ACM-SIAM Sympos. Discrete Algorithms(Association for Computing Machinery, New York), 1228–1241.

2. Avrahami N, Azar Y (2007) Minimizing total flow time and total completion time with immediate dispatching.Algorithmica47(3):253–268.

3. Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality

4. Bansal N, Srinivasan A, Svensson O (2016) Lift-and-round to improve weighted completion time on unrelated machines. Wichs D, Mansour Y, eds.Proc.48th Ann. ACM Sympos. Theory Computing (STOC)(Association for Computing Machinery, New York), 156–167.

5. Becchetti L, Leonardi S (2001) Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. Vitter J, Spirakis P, Yannakiakis M, eds.Proc.33rd Annual ACM Sympos.Theory Comput. (Association for Computing Machinery, New York), 94–103.

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

1. Configuration balancing for stochastic requests;Mathematical Programming;2024-08-08

2. Sequencing Stochastic Jobs with a Single Sample;Lecture Notes in Computer Science;2024

3. Technical Note—Cloud Cost Optimization: Model, Bounds, and Asymptotics;Operations Research;2024-01

4. Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times;Operational Research;2023-06-30

5. An improved greedy algorithm for stochastic online scheduling on unrelated machines;Discrete Optimization;2023-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3