Minimizing Maximum Flow-Time on Related Machines
暂无分享,去创建一个
[1] Bala Kalyanasundaram,et al. On-Line Load Balancing of Temporary Tasks , 1997, J. Algorithms.
[2] Kirk Pruhs,et al. A tutorial on amortized local competitiveness in online scheduling , 2011, SIGA.
[3] Janardhan Kulkarni,et al. Minimizing Flow-Time on Unrelated Machines , 2014, STOC.
[4] Benjamin Moseley,et al. Online scheduling to minimize the maximum delay factor , 2008, SODA.
[5] Naveen Garg. Minimizing Average Flow-Time , 2009, Efficient Algorithms.
[6] Amit Kumar,et al. Resource augmentation for weighted flow-time explained by dual fitting , 2012, SODA.
[7] Amit Kumar,et al. Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines , 2015, Algorithmica.
[8] Jacques Carlier,et al. Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .
[9] Yossi Azar. On-line Load Balancing , 1996, Online Algorithms.
[10] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[11] Sartaj Sahni,et al. Bounds for List Schedules on Uniform Processors , 1980, SIAM J. Comput..
[12] Monaldo Mastrolilli,et al. On-line scheduling to minimize max flow time: an optimal preemptive algorithm , 2005, Oper. Res. Lett..
[13] Michael A. Bender,et al. Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.
[14] Joseph Naor,et al. The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..