Improved Randomized Online Scheduling of Intervals and Jobs

@article{Fung2013ImprovedRO,
  title={Improved Randomized Online Scheduling of Intervals and Jobs},
  author={Stanley P. Y. Fung and Chung Keung Poon and Feifeng Zheng},
  journal={Theory of Computing Systems},
  year={2013},
  volume={55},
  pages={202-228}
}
We study the online preemptive scheduling of intervals and jobs (with restarts). Each interval or job has an arrival time, a deadline, a length and a weight. The objective is to maximize the total weight of completed intervals or jobs. While the deterministic case for intervals was settled a long time ago, the randomized case remains open. In this paper we first give a 2-competitive randomized algorithm for the case of equal length intervals. The algorithm is barely random in the sense that it… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
5 Citations
22 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…