K. Agrawal, J. Li, K. Lu, and B. Moseley, Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.176-189, 2016.
DOI : 10.1137/1.9781611974331.ch14

S. Albers, Energy-efficient algorithms, Communications of the ACM, vol.53, issue.5, pp.86-96, 2010.
DOI : 10.1145/1735223.1735245

S. Albers, Algorithms for dynamic speed scaling, STACS, pp.1-11, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573591

S. Albers, A. Antoniadis, and G. Greiner, On multi-processor speed scaling with migration, Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, SPAA '11, pp.279-288, 2011.
DOI : 10.1145/1989493.1989539

S. Albers, F. Müller, and S. Schmelzer, Speed scaling on parallel processors, SPAA, pp.289-298, 2007.
DOI : 10.1145/1248377.1248424
URL : http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/SPAA/2007/Speed Scaling on Parallel Processors.pdf

M. Andrews, A. F. Anta, L. Zhang, and W. Zhao, Routing for Power Minimization in the Speed Scaling Model, IEEE/ACM Transactions on Networking, vol.20, issue.1, pp.285-294, 2012.
DOI : 10.1109/TNET.2011.2159864

M. Andrews, S. Antonakopoulos, and L. Zhang, Minimum-cost network design with (dis)economies of scale, FOCS, pp.585-592, 2010.

E. Angel, E. Bampis, F. Kacem, and D. Letsios, Speed Scaling on Parallel Processors with Migration, Euro-Par, pp.128-140, 2012.
DOI : 10.1007/978-3-642-32820-6_15
URL : https://hal.archives-ouvertes.fr/hal-00741604

A. Antoniadis and C. Huang, Non-preemptive speed scaling, SWAT, pp.249-260, 2012.
DOI : 10.1007/s10951-013-0312-6

A. Antoniadis, S. Im, R. Krishnaswamy, B. Moseley, V. Nagarajan et al., Hallucination Helps: Energy Efficient Virtual Circuit Routing, SODA, pp.1141-1153, 2014.
DOI : 10.1137/1.9781611973402.84
URL : http://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.84

B. Awerbuch, S. Kutten, and D. Peleg, Competitive distributed job scheduling (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , STOC '92, pp.571-580, 1992.
DOI : 10.1145/129712.129768
URL : http://iew3.technion.ac.il/~kutten/zipped/djs.ps.gz

E. Bampis, V. Chau, D. Letsios, G. Lucarelli, I. Milis et al., Energy Efficient Scheduling of MapReduce Jobs, Euro-Par, pp.198-209, 2014.
DOI : 10.1007/978-3-319-09873-9_17
URL : https://hal.archives-ouvertes.fr/hal-01020100

E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and I. Nemparis, From preemptive to non-preemptive speed-scaling scheduling, Discrete Applied Mathematics, vol.181, pp.11-20, 2015.
DOI : 10.1016/j.dam.2014.10.007
URL : https://hal.archives-ouvertes.fr/hal-00867457

E. Bampis, D. Letsios, and G. Lucarelli, Green scheduling, flows and matchings, Theoretical Computer Science, vol.579, pp.126-136, 2015.
DOI : 10.1016/j.tcs.2015.02.020
URL : https://hal.archives-ouvertes.fr/hal-01366487

E. Bampis, D. Letsios, and G. Lucarelli, A note on multiprocessor speed scaling with precedence constraints, Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, SPAA '14, pp.138-142, 2014.
DOI : 10.1145/2612669.2612672
URL : https://hal.archives-ouvertes.fr/hal-01215576

P. Baptiste, J. Carlier, A. Kononov, M. Queyranne, S. Sevastyanov et al., Properties of optimal schedules in preemptive shop scheduling, Discrete Applied Mathematics, vol.159, issue.5, pp.272-280, 2011.
DOI : 10.1016/j.dam.2010.11.015
URL : https://hal.archives-ouvertes.fr/hal-01306521

D. Berend and T. Tassa, Improved bounds on Bell numbers and on moments of sums of random variables. Probability and Math, Statistics, vol.30, pp.185-205, 2010.

B. D. Bingham and M. R. Greenstreet, Energy Optimal Scheduling on Multiprocessors with Migration, 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications, pp.153-161, 2008.
DOI : 10.1109/ISPA.2008.128

A. R. Brodtkorb, C. Dyken, T. R. Hagen, J. M. Hjelmervik, and O. O. Storaasli, Stateof-the-art in heterogeneous computing, Sci. Program, vol.18, pp.1-33, 2010.

X. Deng, H. Liu, and B. Xiao, Deterministic load balancing in computer networks, SPDP, pp.50-57, 1990.

M. E. Gerards, J. L. Hurink, and P. K. Hölzenspies, A survey of offline algorithms for energy minimization under deadline constraints, Journal of Scheduling, vol.24, issue.7, pp.3-19, 2016.
DOI : 10.1109/TPDS.2012.20

G. Greiner, T. Nonner, and A. Souza, The bell is ringing in speed-scaled multiprocessor scheduling, SPAA, pp.11-18, 2009.

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimizations, 2nd corrected edition, 1993.

A. Gupta, S. Im, R. Krishnaswamy, B. Moseley, and K. Pruhs, Scheduling Heterogeneous Processors Isn't As Easy As You Think, SODA, pp.1242-1253, 2012.
DOI : 10.1137/1.9781611973099.98

A. Gupta, R. Krishnaswamy, and K. Pruhs, Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling, WAOA, pp.173-186, 2012.
DOI : 10.1007/978-3-642-38016-7_15

W. Hoeffding, On the Distribution of the Number of Successes in Independent Trials, The Annals of Mathematical Statistics, vol.27, issue.3, pp.713-721, 1956.
DOI : 10.1214/aoms/1177728178

P. Raghavan and C. D. Thompson, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica, vol.7, issue.4, pp.365-374, 1991.
DOI : 10.1007/978-1-4684-2001-2_9
URL : http://nma.berkeley.edu/ark:/28722/bk000579d87

O. Svensson, Santa claus schedules jobs on unrelated machines, STOC, pp.617-626, 2011.
DOI : 10.1145/1993636.1993718
URL : http://www.nada.kth.se/nada/theory/projects/publications/SantaSched.pdf

A. Wierman, L. L. Andrew, and A. Tang, Power-Aware Speed Scaling in Processor Sharing Systems, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.2007-2015, 2009.
DOI : 10.1109/INFCOM.2009.5062123
URL : https://authors.library.caltech.edu/18244/1/Wierman2009p8304Ieee_Infocom_2009_-_Ieee_Conference_On_Computer_Communications_Vols_1-5.pdf

F. Yao, A. Demers, and S. Shenker, A scheduling model for reduced CPU energy, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.374-382, 1995.
DOI : 10.1109/SFCS.1995.492493
URL : http://www.cs.pitt.edu/~kirk/cs3150spring2010/yds.pdf