Online Non-preemptive Scheduling on Unrelated Machines with Rejections
暂无分享,去创建一个
[1] Nguyen Kim Thang. Online Primal-Dual Algorithms with Configuration Linear Programs , 2020, ISAAC.
[2] Sanjeev Khanna,et al. Algorithms for minimizing weighted flow time , 2001, STOC '01.
[3] Nikhil R. Devanur,et al. Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms , 2014, ACM Trans. Algorithms.
[4] Amit Kumar,et al. Rejecting jobs to minimize load and maximum flow-time , 2014, J. Comput. Syst. Sci..
[5] F. Frances Yao,et al. A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[6] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[7] Gerhard J. Woeginger,et al. Approximability and nonapproximability results for minimizing total flow time on a single machine , 1996, STOC '96.
[8] Cynthia A. Phillips,et al. Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.
[9] Kirk Pruhs,et al. Speed Scaling with an Arbitrary Power Function , 2009, TALG.
[10] Amit Kumar,et al. Resource augmentation for weighted flow-time explained by dual fitting , 2012, SODA.
[11] Kirk Pruhs,et al. Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule , 2009, ICALP.
[12] Nguyen Kim Thang,et al. Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling , 2013, ESA.
[13] Leah Epstein,et al. Optimal on-line flow time with resource augmentation , 2006, Discret. Appl. Math..
[14] Kirk Pruhs,et al. Speed scaling to manage energy and temperature , 2007, JACM.
[15] Johanne Cohen,et al. Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games , 2012, WINE.
[16] Denis Trystram,et al. Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality , 2016, ESA.