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

S. Albers and H. Fujiwara, Energy-efficient algorithms for flow time minimization, ACM Transactions on Algorithms, vol.3, issue.4, p.49, 2007.
DOI : 10.1145/1290672.1290686

B. Alidaee, Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost, Journal of the Operational Research Society, vol.44, issue.2, pp.125-132, 1993.
DOI : 10.1057/jors.1993.24

E. Angel, E. Bampis, and F. Kacem, Energy Aware Scheduling for Unrelated Parallel Machines, 2012 IEEE International Conference on Green Computing and Communications, pp.533-540, 2012.
DOI : 10.1109/GreenCom.2012.78
URL : https://hal.archives-ouvertes.fr/hal-00785112

T. Badics and E. Boros, Minimization of Half-Products, Mathematics of Operations Research, vol.23, issue.3, pp.649-600, 1998.
DOI : 10.1287/moor.23.3.649

U. Bagchi, R. S. Sullivan, and Y. L. Chang, Minimizing Mean Squared Deviation of Completion Times About a Common Due Date, Management Science, vol.33, issue.7, pp.894-906, 1987.
DOI : 10.1287/mnsc.33.7.894

P. Bagga and K. Karlra, Note???A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem, Management Science, vol.26, issue.6, pp.633-636, 1980.
DOI : 10.1287/mnsc.26.6.633

N. Bansal, H. L. Chan, D. Katz, and K. Pruhs, Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule, Theory of Computing, vol.8, pp.209-229, 2012.
DOI : 10.1007/978-3-642-02927-1_14

N. Bansal, T. Kimbrel, and K. Pruhs, Speed scaling to manage energy and temperature, Journal of the ACM, vol.54, issue.1, p.3, 2007.
DOI : 10.1145/1206035.1206038
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.550.7426

N. Bansal and K. Pruhs, The geometry of scheduling, Proc. of the IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS), pp.407-414, 2010.

D. M. Brooks, P. Bose, S. E. Schuster, H. Jacobson, P. N. Kudva et al., Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors, pp.2026-2070, 2000.

R. A. Carrasco, G. Iyengar, and C. Stein, Energy aware scheduling for weighted completion time and weighted tardiness, 2011.

S. H. Chan, T. W. Lam, and L. K. Lee, Non-clairvoyant Speed Scaling for Weighted Flow Time, Proc. of the 18th Annual European Symposium (ESA), pp.23-35, 2010.
DOI : 10.1007/978-3-642-15775-2_3

T. Cheng, C. Ng, J. Yuan, and Z. Liu, Single machine scheduling to minimize total weighted tardiness, European Journal of Operational Research, vol.165, issue.2, pp.423-443, 2005.
DOI : 10.1016/j.ejor.2004.04.013

T. E. Cheng and Z. Liu, Parallel machine scheduling to minimize the sum of quadratic completion times, IIE Transactions, vol.44, issue.1, pp.11-17, 2004.
DOI : 10.1287/mnsc.24.5.530

M. Cheung and D. Shmoys, A primal-dual approximation algorithm for min-sum singlemachine scheduling problems, Proc. of the 14th International Workshop APPROX and 15th International Workshop RANDOM, pp.135-146, 2011.

F. Croce, R. Tadei, P. Baracco, and R. D. Tullio, On minimizing the weighted sum of quadratic completion times on a single machine, Proc. of the IEEE International Conference on Robotics and Automation, pp.816-820, 1993.

J. Du and J. Leung, Minimizing Total Tardiness on One Machine is NP-Hard, Mathematics of Operations Research, vol.15, issue.3, pp.483-495, 1990.
DOI : 10.1287/moor.15.3.483

C. Dürr, Scheduling zoo, 2013.

C. Dürr and O. C. Vásquez, Order constraints for single machine scheduling with nonlinear cost, Proc. of the 16th Workshop on Algorithm Engineering and Experiments (ALENEX), pp.98-111, 2014.

D. Easley and J. Kleinberg, Networks, crowds, and markets, 2010.
DOI : 10.1017/CBO9780511761942

L. Epstein, A. Levin, A. Marchetti-spaccamela, N. Megow, J. Mestre et al., Universal Sequencing on a Single Machine, Proc. of the 14th International Conference of Integer Programming and Combinatorial Optimization (IPCO), pp.230-243, 2010.
DOI : 10.1007/978-3-642-13036-6_18

E. Erel and J. B. Ghosh, FPTAS for half-products minimization with scheduling applications, Discrete Applied Mathematics, vol.156, issue.15, pp.3046-3056, 2008.
DOI : 10.1016/j.dam.2008.01.018

G. Gamow and M. Stern, Puzzle-math, 1958.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

R. Graham, E. Lawler, J. Lenstra, and A. Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, vol.5, issue.2, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

N. Hall, W. Kubiak, and S. Sethi, Earliness???Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date, Operations Research, vol.39, issue.5, pp.847-856, 1991.
DOI : 10.1287/opre.39.5.847

P. E. Hart, N. J. Nilsson, and B. Raphael, <u>Correction</u> to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths", ACM SIGART Bulletin, vol.37, issue.37, pp.28-29, 1972.
DOI : 10.1145/1056777.1056779

W. Höhn, Scheduling (Dagstuhl Seminar 13111) Dagstuhl Research Online Publication Server, pp.32-33, 2013.

W. Höhn and T. Jacobs, An experimental and analytical study of order constraints for single machine scheduling with quadratic cost, Proc. of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX'12), pp.103-117, 2012.

W. Höhn and T. Jacobs, Generalized min sum scheduling instance libraryv-menue/projekte/complex scheduling/generalized minsum scheduling instance library, p.2012

W. Höhn and T. Jacobs, On the performance of Smith's rule in single-machine scheduling with nonlinear cost, Proc. of the 10th Latin American Theoretical Informatics Symposium (LATIN), pp.482-493, 2012.

J. Hoogeveen and S. Van-de-velde, Scheduling around a small common due date, European Journal of Operational Research, vol.55, issue.2, pp.237-242, 1991.
DOI : 10.1016/0377-2217(91)90228-N
URL : http://repub.eur.nl/pub/12356/SchedulingAround_1991.pdf

O. H. Ibarra and C. E. Kim, Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems, Journal of the ACM, vol.22, issue.4, pp.463-468, 1975.
DOI : 10.1145/321906.321909

S. Irani and K. Pruhs, Algorithmic problems in power management, ACM SIGACT News, vol.36, issue.2, pp.63-76, 2005.
DOI : 10.1145/1067309.1067324

B. Jurisch, W. Kubiak, and J. Jozefowska, Algorithms for minclique scheduling problems, Discrete Applied Mathematics, vol.72, issue.1-2, pp.115-139, 1997.
DOI : 10.1016/S0166-218X(96)00040-6

I. Kacem, Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date, Discrete Applied Mathematics, vol.158, issue.9, pp.1035-1040, 2010.
DOI : 10.1016/j.dam.2010.01.013

H. Kaindl, G. Kainz, and K. Radda, Asymmetry in search, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.31, issue.5, pp.31791-796, 2001.
DOI : 10.1109/3477.956040

H. Kellerer and V. A. Strusevich, A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date, Theoretical Computer Science, vol.369, issue.1-3, pp.230-238, 2006.
DOI : 10.1016/j.tcs.2006.08.030

H. Kellerer and A. S. Vitaly, MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK, International Journal of Foundations of Computer Science, vol.21, issue.03, pp.357-383, 2010.
DOI : 10.1142/S0129054110007301

W. Kubiak, Completion time variance minimization on a single machine is difficult, Operations Research Letters, vol.14, issue.1, pp.49-59, 1993.
DOI : 10.1016/0167-6377(93)90019-D

E. L. Lawler and J. M. Moore, A Functional Equation and its Application to Resource Allocation and Sequencing Problems, Management Science, vol.16, issue.1, pp.77-84, 1969.
DOI : 10.1287/mnsc.16.1.77

M. Li, A. C. Yao, and F. F. Yao, Discrete and continuous min-energy schedules for variable voltage processors, Proceedings of the National Academy of Sciences, vol.103, issue.11, pp.3983-3987, 2006.
DOI : 10.1073/pnas.0510886103

N. Megow and J. Verschae, Dual Techniques for Scheduling on a Machine with Varying Speed, Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP), pp.745-756, 2013.
DOI : 10.1007/978-3-642-39206-1_63

S. Mondal and A. Sen, An improved precedence rule for single machine sequencing problems with quadratic penalty, European Journal of Operational Research, vol.125, issue.2, pp.425-428, 2000.
DOI : 10.1016/S0377-2217(99)00207-6

D. Monderer and L. Shapley, Potential Games, Games and Economic Behavior, vol.14, issue.1, pp.124-143, 1996.
DOI : 10.1006/game.1996.0044

H. Moulin and S. Shenker, Strategyproof Sharing of Submodular Access Costs: Budget Balance versus Efficiency, SSRN Electronic Journal, vol.18, issue.3, pp.511-533, 2001.
DOI : 10.2139/ssrn.42940

N. Nisan, Algorithmic game theory, 2007.
DOI : 10.1017/CBO9780511800481

K. Pruhs, P. Uthaisombut, and G. Woeginger, Getting the best response for your erg, ACM Transactions on Algorithms (TALG), vol.4, issue.3, p.38, 2008.

M. H. Rothkopf, Scheduling Independent Tasks on Parallel Processors, Management Science, vol.12, issue.5, pp.437-447, 1966.
DOI : 10.1287/mnsc.12.5.437

A. K. Sen, A. Bagchi, and R. Ramaswamy, Searching graphs with A*: applications to job sequencing, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, vol.26, issue.1, pp.168-173, 1996.
DOI : 10.1109/3468.477872

T. Sen, P. Dileepan, and B. , Minimizing a generalized quadratic penalty function of job completion times: an improved branch-and-bound approach. Engineering Costs and Production Economics, pp.197-202, 1990.

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

B. Srirangacharyulu and G. Srinivasan, An exact algorithm to minimize mean squared deviation of job completion times about a common due date, European Journal of Operational Research, vol.231, issue.3, pp.547-556, 2013.
DOI : 10.1016/j.ejor.2013.06.017

W. Szwarc, Decomposition in single-machine scheduling, Annals of Operations Research, vol.83, pp.271-287, 1998.
DOI : 10.1023/A:1018916215399

W. Townsend, The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution, Management Science, vol.24, issue.5, pp.530-534, 1978.
DOI : 10.1287/mnsc.24.5.530

O. C. Vasquez, Energy in computing systems with speed scaling: optimization and mechanisms design, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00908270

O. C. Vásquez, On the complexity of the single machine scheduling problem minimizing total weighted delay penalty. manuscript, 2013.

J. Verschae, Personal communication, 2013.

X. Weng and J. A. Ventura, Scheduling about a given common due date to minimize mean squared deviation of completion times, European Journal of Operational Research, vol.88, issue.2, pp.328-335, 1996.
DOI : 10.1016/0377-2217(94)00195-2

G. J. Woeginger, Scheduling (Dagstuhl Seminar 10071) Dagstuhl Research Online Publication Server, p.24, 2010.

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

J. Yuan, The NP-hardness of the single machine common due date weighted tardiness problem, System Science and Mathematical Sciences, vol.5, issue.4, pp.328-333, 1992.