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

M. A. Bender, S. Chakrabarti, and S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, ACM-SIAM Symposium on Discrete Algorithms, pp.270-279, 1998.

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

M. Drozdowski, Scheduling for Parallel Processing Computer Communications and Networks, 2009.

P. Dutot, E. Saule, A. Srivastav, and D. Trystram, Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine, International Conference on Computing and Combinatorics (COCOON), pp.483-495, 2016.
DOI : 10.1007/978-3-319-42634-1_39

URL : https://hal.archives-ouvertes.fr/hal-01309052

G. Dror and . Feitelson, Metrics for parallel job scheduling and their convergence, Job Scheduling Strategies for Parallel Processing, pp.188-206, 2001.

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Legrand, A. Su, and F. Vivien, Minimizing the stretch when scheduling flows of divisible requests, Journal of Scheduling, vol.3, issue.1, pp.381-404, 2008.
DOI : 10.1007/s10951-008-0078-4

URL : https://hal.archives-ouvertes.fr/inria-00108524

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

URL : http://doi.org/10.1016/j.jcss.2006.10.018

G. Lucarelli, N. Kim-thang, A. Srivastav, and D. Trystram, Online non-preemptive scheduling in a resource augmentation model based on duality, European Symposium on Algorithms (ESA) Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.1-63, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01334219

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

O. Sarood, A. Langer, A. Gupta, and L. V. Kalé, Maximizing Throughput of Overprovisioned HPC Data Centers Under a Strict Power Budget, SC14: International Conference for High Performance Computing, Networking, Storage and Analysis, pp.807-818, 2014.
DOI : 10.1109/SC.2014.71

W. E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly, vol.2, issue.1-2, pp.59-66, 1956.
DOI : 10.1002/nav.3800030106

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