K. R. Baker, Introduction to Sequencing and Scheduling, 1974.

N. Bansal and H. Chan, Weighted flow time does not admit O(1)-competitive algorithms, SODA, pp.1238-1244, 2009.
DOI : 10.1137/1.9781611973068.134

N. Bansal, H. Chan, R. Khandekar, K. Pruhs, C. Stein et al., Nonpreemptive min-sum scheduling with resource augmentation, FOCS, pp.614-624, 2007.

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

N. Bansal and K. Pruhs, The Geometry of Scheduling, SIAM Journal on Computing, vol.43, issue.5, pp.1684-1698, 2014.
DOI : 10.1137/130911317

L. Becchetti, S. Leonardi, A. Marchetti-spaccamela, and K. Pruhs, Online weighted flow time and deadline scheduling, Journal of Discrete Algorithms, vol.4, issue.3, pp.339-352, 2006.
DOI : 10.1016/j.jda.2005.12.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.52

M. A. Bender, S. Muthukrishnan, and R. Rajaraman, Approximation Algorithms for Average Stretch Scheduling, Journal of Scheduling, vol.7, issue.3, pp.195-222, 2004.
DOI : 10.1023/B:JOSH.0000019681.52701.8b
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.6029

D. P. Bunde, SPT is optimally competitive for uniprocessor flow, Information Processing Letters, vol.90, issue.5, pp.233-238, 2004.
DOI : 10.1016/j.ipl.2004.02.013
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.997

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

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.1137/1.9781611973730.75

A. R. Choudhury, S. Das, and A. Kumar, Minimizing weighted lp-norm of flowtime in the rejection model, FSTTCS, pp.25-37, 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.
DOI : 10.1016/j.dam.2005.05.016

S. Im, S. Li, B. Moseley, and E. Torng, A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract], SODA, pp.1070-1086, 2015.
DOI : 10.1137/1.9781611973730.72

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

H. Kellerer, T. Tautenhahn, and G. J. Woeginger, Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine, SIAM Journal on Computing, vol.28, issue.4, pp.1155-1166, 1999.
DOI : 10.1137/S0097539796305778

S. Leonardi and D. Raz, Approximating total flow time on parallel machines, Journal of Computer and System Sciences, vol.73, issue.6, pp.875-891, 2007.
DOI : 10.1016/j.jcss.2006.10.018

S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. E. Gehrke, Online Scheduling to Minimize Average Stretch, SIAM Journal on Computing, vol.34, issue.2, pp.433-452, 2005.
DOI : 10.1137/S0097539701387544

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

L. Schrage, Letter to the Editor???A Proof of the Optimality of the Shortest Remaining Processing Time Discipline, Operations Research, vol.16, issue.3, pp.687-690, 1968.
DOI : 10.1287/opre.16.3.687

J. Tao and T. Liu, WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines, Mathematical Problems in Engineering, vol.2013, 1155.
DOI : 10.1137/S089548019936223X