On-line scheduling of equal-length intervals on parallel machines-Reference-Cited by-同舟云学术

On-line scheduling of equal-length intervals on parallel machines

Published:2012-05 Issue:10 Volume:112 Page:376-379
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Fung Stanley P.Y.,Poon Chung Keung,Yung Duncan K.W.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference10 articles.

1. B. Awerbuch, Y. Bartal, A. Fiat, A. Rosen, Competitive non-preemptive call control, in: Proceedings of the Fifth Annual ACM–SIAM Symposium on Discrete Algorithms, 1994, pp. 312–320.

2. Online Computation and Competitive Analysis;Borodin,1998

3. Bounding the power of preemption in randomized scheduling;Canettie;SIAM Journal on Computing,1998

4. Improved randomized results for the interval selection problem;Epstein;Theoretical Computer Science,2010

5. Note on scheduling intervals on-line;Faigle;Discrete Applied Mathematics,1995

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

1. Any-Order Online Interval Selection;Approximation and Online Algorithms;2023

2. Online interval scheduling to maximize total satisfaction;Theoretical Computer Science;2020-02

3. Approximation algorithms for scheduling C-benevolent jobs on weighted machines;IISE Transactions;2019-09-26

4. Online interval scheduling on two related machines: the power of lookahead;Journal of Combinatorial Optimization;2019-01-09

5. Online Interval Scheduling to Maximize Total Satisfaction;Lecture Notes in Computer Science;2018