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

N. Bansal, H. L. Chan, T. W. Lam, and L. K. Lee, Scheduling for Speed Bounded Processors, Proc. of International Colloquium on Automata, Languages and Programming, ICALP, pp.409-420, 2008.
DOI : 10.1007/978-3-540-70575-8_34

N. Bansal, H. Chan, and K. Pruhs, Speed scaling with an arbitrary power function. sub- mitted

N. Bansal, K. Pruhs, and C. Stein, Speed Scaling for Weighted Flow Time, SODA '07: Proceedings of the eighteenth annual ACM-SIAM Symposium on Discrete Algorithms, pp.805-813, 2007.
DOI : 10.1137/08072125X
URL : http://repository.tue.nl/693881

L. Becchetti and S. Leonardi, Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines, Journal of the ACM, vol.51, issue.4, pp.517-539, 2004.
DOI : 10.1145/1008731.1008732

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

J. Edmonds, Scheduling in the dark, Theoretical Computer Science, vol.235, issue.1, pp.109-141, 2000.
DOI : 10.1016/S0304-3975(99)00186-3

J. Edmonds and K. Pruhs, Scalably scheduling processes with arbitrary speedup curves

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.5046

B. Kalyanasundaram and K. Pruhs, Minimizing flow time nonclairvoyantly, Journal of the ACM, vol.50, issue.4, pp.551-567, 2003.
DOI : 10.1145/792538.792545
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2328

T. W. Lam, L. K. Lee, I. To, and P. Wong, Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count, Proc. of European Symposium on Algorithms, 2008.
DOI : 10.1007/978-3-540-87744-8_54

R. Motwani, S. Phillips, and E. Torng, Nonclairvoyant scheduling, Theorertical Computer Scienc3, pp.17-47, 1994.
DOI : 10.1016/0304-3975(94)90151-1
URL : http://doi.org/10.1016/0304-3975(94)90151-1

K. Pruhs, Competitive online scheduling for server systems, ACM SIGMETRICS Performance Evaluation Review, vol.34, issue.4, pp.52-58, 2007.
DOI : 10.1145/1243401.1243411

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