Polynomial Time Algorithms for Minimum Energy Scheduling-Reference-Cited by-同舟云学术

Polynomial Time Algorithms for Minimum Energy Scheduling

Published:2007 Issue: Volume: Page:136-150
ISSN:0302-9743
Container-title:Algorithms – ESA 2007
language:
Short-container-title:

Author:

Baptiste Philippe,Chrobak Marek,Dürr Christoph

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-75520-3_14

Reference8 articles.

1. Augustine, J., Irani, S., Swamy, C.: Optimal power-down strategies. In: Proc. 45th Symp. Foundations of Computer Science (FOCS 2004), pp. 530–539 (2004)

2. Baptiste, P.: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In: Proc. 17th Annual ACM-SIAM symposium on Discrete Algorithms (SODA 2006), pp. 364–367 (2006)

3. Chretienne, P.: On the no-wait single-machine scheduling problem. In: Proc. 7th Workshop on Models and Algorithms for Planning and Scheduling Problems (2005)

4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Co., New York (1979)

5. Irani, S., Gupta, R., Shukla, S.: Competitive analysis of dynamic power management strategies for systems with multiple power savings states. In: Proc. Conf. on Design, Automation and Test in Europe (DATE 2002), p. 117 (2002)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Greedy Minimum-Energy Scheduling;Approximation and Online Algorithms;2023

2. Scheduling with gaps: new models and algorithms;Journal of Scheduling;2021-07-21

3. Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity;Lecture Notes in Computer Science;2017

4. A greedy approximation algorithm for minimum-gap scheduling;Journal of Scheduling;2016-07-27

5. Scheduling with Gaps: New Models and Algorithms;Lecture Notes in Computer Science;2015