@inproceedings{553c27fae121452c8064f94909039e3a,

title = "Speed scaling with a solar cell",

abstract = "We consider the speed scaling problem of scheduling a collection of tasks with release times, deadlines, and sizes so as to minimize the energy recharge rate. This is the first theoretical investigation of speed scaling for devices with a regenerative energy source. We show that the problem can be expressed as a polynomial sized convex program. We that using the KKT conditions, one can obtain an efficient algorithm to verify the optimality of a schedule. We show that the energy optimal YDS schedule, is 2-approximate with respect to the recharge rate. We show that the online algorithm BKP is O(1)-competitive with respect to recharge rate.",

author = "N. Bansal and H.L. Chan and K.R. Pruhs",

year = "2008",

doi = "10.1007/978-3-540-68880-8_4",

language = "English",

isbn = "978-3-540-68865-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "15--26",

editor = "R. Fleischer and J. Xu",

booktitle = "Algorithmic Aspects in Information and Management (4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings)",

address = "Germany",

}