S. Anand, N. Garg, and A. Kumar, Resource Augmentation for Weighted Flow-time explained by Dual Fitting, SODA, pp.1228-1241, 2012.
DOI : 10.1137/1.9781611973099.97
URL : http://www.cse.iitd.ac.in/%7Eamitk/305_Kumar.pdf

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 , STOC '01, pp.84-93, 2001.
DOI : 10.1145/380752.380778
URL : https://repository.upenn.edu/cgi/viewcontent.cgi?article=1069&context=cis_papers

A. R. Choudhury, S. Das, and A. Kumar, Minimizing weighted L p -norm of flow-time in the rejection model, FSTTCS of LIPIcs, pp.25-37, 2015.

A. R. Choudhury, S. Das, N. Garg, and A. Kumar, Rejecting jobs to minimize load and maximum flow-time, SODA, pp.1114-1133, 2015.
DOI : 10.1016/j.jcss.2017.07.006
URL : http://arxiv.org/pdf/1410.1839

N. Garg and A. Kumar, Minimizing Average Flow-time : Upper and Lower Bounds, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), pp.603-613, 2007.
DOI : 10.1109/FOCS.2007.52
URL : http://www.cse.iitd.ernet.in/~amitk/focs07.pdf

B. Kalyanasundaram and K. Pruhs, Speed is as powerful as clairvoyance, Journal of the ACM, vol.47, issue.4, pp.617-643, 2000.
DOI : 10.1145/347476.347479
URL : http://www.cs.pitt.edu/~kirk/papers/focs.ps

G. Lucarelli, N. K. Thang, A. Srivastav, and D. Trystram, Online non-preemptive scheduling in a resource augmentation model based on duality, ESA, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01334219

C. A. Phillips, C. Stein, E. Torng, and J. Wein, Optimal Time-Critical Scheduling via Resource Augmentation, Algorithmica, vol.32, issue.2, pp.163-200, 2002.
DOI : 10.1007/s00453-001-0068-9