Author:
Becchetti Luca,Leonardi Stefano,Marchetti-Spaccamela Alberto,Pruhs Kirk R.
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. S. Aacharya, and S. Muthukrishnan, “Scheduling on-demand broadcasts: new metrics and algorithms”, 4th ACM/IEEE International Conference on Mobile Computing and Networking, 43–54, 1998.
2. Y. Bartal, and S. Muthukrishnan, “Minimizing Maximum Response Time in Scheduling Broadcasts”, 558–559, Proceedings of the Eleventh Annual ACM/SIAM Symposium on Discrete Algorithms, pages 558–559, 2000.
3. Lect Notes Comput Sci;M. Goemans,1996
4. J. Labetoulle, E. Lawler, J.K. Lenstra, A. Rinnooy Kan, “Preemptive scheduling of uniform machines subject to release dates”, in W.R. Pulleyblank (eds.), Progress in Combinatorial Optimization, 245–261, Academic Press, 1984.
5. E. Lawler, J.K. Lenstra, A. Rinnooy Kan, and D. Shmoys, “Sequencing and Scheduling: Algorithms and Complexity”, Logistics of Production and Inventory, Handbooks in OR & MS 4, Elsevier Science, Chapter 9, 445–522, 1993.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Metrics for Packing Efficiency and Fairness of HPC Cluster Batch Job Scheduling;2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD);2022-11
2. On-Line Algorithms;Paradigms of Combinatorial Optimization;2013-02-13
3. Adaptive Query Scheduling in Key-Value Data Stores;Database Systems for Advanced Applications;2013
4. Algorithms for Cost-Aware Scheduling;Approximation and Online Algorithms;2013
5. Universal Sequencing on a Single Machine;Integer Programming and Combinatorial Optimization;2010