S. Anand, N. Garg, and A. Kumar, Resource augmentation for weighted flow-time explained by dual fitting, Proceedings of Symposium on Discrete Algorithms (SODA, 2012), pp.1228-1241, 2012.

N. Bansal and H. Chan, Weighted flow time does not admit o(1)-competitive algorithms, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA, 2009), pp.1238-1244, 2009.

N. Bansal and K. Dhamdhere, Minimizing weighted flow time, ACM Transactions on Algorithms, vol.3, issue.4, 2007.

C. Chekuri, S. Khanna, and A. Zhu, Algorithms for minimizing weighted flow time, Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp.84-93, 2001.

S. Anamitra-roy-choudhury, N. Das, A. Garg, and . Kumar, Rejecting jobs to minimize load and maximum flow-time, Proc. Symposium on Discrete Algorithms, pp.1114-1133, 2015.

L. Epstein and R. Van-stee, Optimal on-line flow time with resource augmentation, Discrete Applied Mathematics, vol.154, issue.4, pp.611-621, 2006.

B. Kalyanasundaram and K. Pruhs, Speed is as powerful as clairvoyance, J. ACM, vol.47, issue.4, pp.617-643, 2000.

G. Lucarelli, B. Moseley, N. Kim-thang, A. Srivastav, and D. Trystram, Online non-preemptive scheduling on unrelated machines with rejections, ACM Symposium on Parellelism in Algorithms and Architectures (SPAA, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01986312

G. Lucarelli, K. Nguyen, A. Thang, D. Srivastav, and . Trystram, Online nonpreemptive scheduling in a resource augmentation model based on duality, European Symposium on Algorithms (ESA, 2016), vol.57, pp.1-17, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01334219

A. Cynthia, C. Phillips, E. Stein, J. Torng, and . Wein, Optimal time-critical scheduling via resource augmentation, Algorithmica, vol.32, issue.2, pp.163-200, 2002.