A greedy approximation algorithm for minimum-gap scheduling-Reference-Cited by-同舟云学术

A greedy approximation algorithm for minimum-gap scheduling

Published:2016-07-27 Issue:3 Volume:20 Page:279-292
ISSN:1094-6136
Container-title:Journal of Scheduling
language:en
Short-container-title:J Sched

Author:

Chrobak Marek,Feige Uriel,Hajiaghayi Mohammad Taghi,Khanna Sanjeev,Li Fei,Naor Seffi

Funder

National Science Foundation

Office of Naval Research

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,General Engineering,Software

Link

http://link.springer.com/content/pdf/10.1007/s10951-016-0492-y.pdf

Reference11 articles.

1. Albers, S. (2010). Energy-efficient algorithms. Communications of the ACM, 53(5), 86–96.

2. Albers, S., & Antoniadis, A. (2012). Race to idle: New algorithms for speed scaling with a sleep state. In Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 1266–1285).

3. Albers, S., & Antoniadis, A. (2014). Race to idle: New algorithms for speed scaling with a sleep state. ACM Transactions on Algorithms (TALG), 10(2), 9.

4. Baptiste, P. (2006). Scheduling unit tasks to minimize the number of idle periods: A polynomial time algorithm for offline dynamic power management. In Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 364–367).

5. Baptiste, P., Chrobak, M., & Dürr, C. (2007). Polynomial time algorithms for minimum energy scheduling. In Proceedings of the 15th annual European symposium on algorithms (ESA) (pp. 136–150).

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

1. An $$O(n^3)$$-Time Algorithm for the Min-Gap Unit-Length Job Scheduling Problem;Lecture Notes in Computer Science;2022

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