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

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, Proc. 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp.289-298, 2007.
DOI : 10.1007/s00453-012-9678-7

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

E. Angel, E. Bampis, and V. Chau, Throughput maximization in the speed-scaling setting, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01077059

E. Angel, E. Bampis, V. Chau, and D. Letsios, Throughput maximization for speed scaling with agreeable deadlines, Proc. 10th International Conference Theory and Applications of Models of Computation (TAMC), pp.10-19, 2013.
DOI : 10.1007/s10951-015-0452-y

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

E. Angel, E. Bampis, F. Kacem, and D. Letsios, Speed Scaling on Parallel Processors with Migration, Proc. 18th International Conference 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, Journal of Scheduling, vol.35, issue.5, pp.385-394, 2013.
DOI : 10.1007/s10951-013-0312-6

A. Antoniadis, C. Huang, S. Ott, and J. Verschae, How to Pack Your Items When You Have to Buy Your Knapsack, MFCS, pp.62-73, 2013.
DOI : 10.1007/978-3-642-40313-2_8

E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and I. Nemparis, From preemptive to nonpreemptive speed-scaling scheduling, Proc. 19th International Conference, Computing and Combinatorics (COCOON), pp.134-146, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00867457

E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and M. Sviridenko, Energy-efficient scheduling and routing via randomized rounding, FSTTCS, 2013.
DOI : 10.1007/s10951-016-0500-2

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

E. Bampis, D. Letsios, and G. Lucarelli, Green scheduling, flows and matchings, Proc. 23rd International Symposium on Algorithms and Computation (ISAAC), pp.106-115, 2012.
DOI : 10.1007/978-3-642-35261-4_14

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

N. Bansal, H. Chan, T. W. Lam, and L. Lee, Scheduling for Speed Bounded Processors, LNCS, vol.1, issue.5125, pp.409-420, 2008.
DOI : 10.1007/978-3-540-70575-8_34

P. Baptiste, An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Operations Research Letters, vol.24, issue.4, pp.175-180, 1999.
DOI : 10.1016/S0167-6377(98)00045-5

P. Brucker, Scheduling Algorithms, 2010.

T. Carnes and D. B. Shmoys, Primal-dual schema for capacitated covering problems, Proc. 13th Conference on Integer Programming and Combinatorial Optimization (IPCO), pp.288-302, 2008.
DOI : 10.1007/978-3-540-68891-4_20

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

R. D. Carr, L. Fleischer, V. J. Leung, and C. A. Phillips, Strengthening integrality gaps for capacitated network design and covering problems, Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.106-115, 2000.

H. Chan, W. Chan, T. W. Lam, L. Lee, K. Mak et al., Energy efficient online deadline scheduling, SODA, pp.795-804, 2007.

H. Chan, T. W. Lam, and R. Li, Tradeoff between energy and throughput for online deadline scheduling, WAOA, pp.59-70, 2010.

J. W. Chan, T. W. Lam, K. Mak, and P. W. Wong, Online Deadline Scheduling with Bounded Energy Efficiency, TAMC, pp.416-427, 2007.
DOI : 10.1007/978-3-540-72504-6_38

N. R. Devanur and K. Jain, Online matching with concave returns, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.137-144, 2012.
DOI : 10.1145/2213977.2213992

G. Greiner, T. Nonner, and A. Souza, The bell is ringing in speed-scaled multiprocessor scheduling, Proc. 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp.11-18, 2009.

C. Huang and S. Ott, New Results for Non-Preemptive Speed Scaling, 2013.
DOI : 10.1007/978-3-662-44465-8_31

T. W. Lam, L. Lee, I. K. To, and P. W. Wong, Energy Efficient Deadline Scheduling in Two Processor Systems, ISAAC, pp.476-487, 2007.
DOI : 10.1007/978-3-540-77120-3_42

E. Lawler, A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Annals of Operations Research, vol.15, issue.1, pp.125-133, 1990.
DOI : 10.1007/BF02248588

M. Li, Approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristics, Theoretical Computer Science, vol.412, issue.32, pp.4074-4080, 2011.
DOI : 10.1016/j.tcs.2010.10.011

F. F. Yao, A. J. 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