[1] Susanne Albers. Energy-efficient algorithms. Communications of the ACM, 53(5):86-96, 2010.
[2] Susanne Albers and Hiroshi Fujiwara. Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms (TALG), 3(4):49-es, 2007.
[3] Lachlan LH Andrew, Adam Wierman, and Ao Tang. Optimal speed scaling under arbitrary power functions. ACM SIGMETRICS Performance Evaluation Review, 37(2):39-41, 2009.
[4] Antonios Antoniadis, Peyman Jabbarzade Ganje, and Golnoosh Shahkarami. A novel prediction setup for online speed-scaling. In Artur Czumaj and Qin Xin, editors, 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórhavn, Faroe Islands, volume 227 of LIPIcs, pages 9:1-9:20, 2022. doi: 10.4230/LIPIcs.SWAT.2022.9. URL https://doi.org/10.4230/LIPIcs.SWAT.2022.9.
[5] Eric Balkanski, Vasilis Gkatzelis, and Xizhi Tan. Strategyproof scheduling with predictions. arXiv preprint arXiv:2209.04058, 2022.
[6] Eric Balkanski, Tingting Ou, Clifford Stein, and Hao-Ting Wei. Scheduling with speed predictions. arXiv preprint arXiv:2205.01247, 2022.
[7] Étienne Bamas, Andreas Maggiori, Lars Rohwedder, and Ola Svensson. Learning augmented energy minimization via speed scaling. In Hugo Larochelle, Marc'Aurelio Ranzato, Raia Hadsell, Maria-Florina Balcan, and Hsuan-Tien Lin, editors, Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual, 2020. URL https://proceedings.neurips.cc/paper/2020/black/af94ed0d6f5acc95f97170e3685f16c0-Abstract.html.
[8] Nikhil Bansal and Ho-Leung Chan. Weighted flow time does not admit o (1)-competitive algorithms. In Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, pages 1238-1244. SIAM, 2009.
[9] Nikhil Bansal and Kirk Pruhs. The geometry of scheduling. SIAM J. Comput., 43(5):1684-1698, 2014. doi: 10.1137/130911317. URL https://doi.org/10.1137/130911317.
[10] Nikhil Bansal, Tracy Kimbrel, and Kirk Pruhs. Speed scaling to manage energy and temperature. Journal of the ACM (JACM), 54(1):1-39, 2007.
[11] Nikhil Bansal, Ho-Leung Chan, Tak-Wah Lam, and Lap-Kei Lee. Scheduling for speed bounded processors. In International Colloquium on Automata, Languages, and Programming, pages 409–420. Springer, 2008.
[12] Nikhil Bansal, Kirk Pruhs, and Cliff Stein. Speed scaling for weighted flow time. SIAM Journal on Computing, 39(4):1294-1308, 2010.
[13] Nikhil Bansal, David P Bunde, Ho-Leung Chan, and Kirk Pruhs. Average rate speed scaling. Algorithmica, 60(4):877-889, 2011.
[14] Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs. Speed scaling with an arbitrary power function. ACM Transactions on Algorithms (TALG), 9(2):1-14, 2013.
[15] David M Brooks, Pradip Bose, Stanley E Schuster, Hans Jacobson, Prabhakar N Kudva, Alper Buyuktosunoglu, John Wellman, Victor Zyuban, Manish Gupta, and Peter W Cook. Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors. IEEE Micro, 20(6):26-44, 2000.
[16] Woo-Hyung Cho, Shane Henderson, and David Shmoys. Scheduling with predictions. arXiv preprint arXiv:2212.10433, 2022.
[17] Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, and Manish Purohit. Non-clairvoyant scheduling with predictions. In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, pages 285-294, 2021.