A greedy approximation algorithm for minimum-gap scheduling
Authors:
- 27 July 2016
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 20 (3) , 279-292
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CCF-1216993, CCF- 1217314)
- National Science Foundation (CCF-1536026, OISE-1157129)
- National Science Foundation (CAREER award 1053605)
- Office of Naval Research (N000141110662)
- National Science Foundation (CCF-0915681)
This publication has 9 references indexed in Scilit:
- On the NP-hardness of speed scaling with sleep stateTheoretical Computer Science, 2015
- Scheduling to minimize gaps and power consumptionJournal of Scheduling, 2013
- Race to Idle: New Algorithms for Speed Scaling with a Sleep State2012
- Energy-efficient algorithmsCommunications of the ACM, 2010
- On single-machine scheduling without intermediate delaysDiscrete Applied Mathematics, 2008
- Scheduling to minimize gaps and power consumption2007
- Polynomial Time Algorithms for Minimum Energy Scheduling2007
- Scheduling unit tasks to minimize the number of idle periods2006
- Algorithmic problems in power managementACM SIGACT News, 2005