Online interval scheduling: Randomized and multiprocessor cases

Journal of Combinatorial Optimization

Volumn 16, Issue 3, 2008, Pages 248-262

  Fung, Stanley P Y ^a   Poon, Chung Keung ^b   Zheng, Feifeng ^c  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Intervals; Online algorithms; Randomization; Scheduling

Indexed keywords

MULTIPROCESSING SYSTEMS; SCHEDULING;

COMPETITIVE RATIOS; INTERVAL SCHEDULING; INTERVALS; LOWER BOUNDS; ONLINE ALGORITHMS; RANDOMIZATION; RANDOMIZED ALGORITHMS; TOTAL WEIGHT; TWO PROCESSORS;

CONTROL THEORY;

EID: 49749134384     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9131-z     Document Type: Article

References (18)

1. Awerbuch B, Bartal Y, Fiat A, Rosen A (1994) Competitive non-preemptive call control. In: Proceedings of 5th ACM-SIAM symposium on discrete algorithms, pp 312-320
2. Baruah S, Koren G, Mao D, Mishra B, Raghunathan A, Rosier L, Shasha D, Wang F (1992) On the competitiveness of on-line real-time task scheduling. Real-Time Syst 4:125-144
3. Bogart KP, West DB (1999) A short proof that proper∈=∈unit. Discrete Math 201:21-23
4. Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, New York
5. Canetti R, Irani S (1998) Bounding the power of preemption in randomized scheduling. SIAM J Comput 27(4):993-1015
6. Chan W-T, Lam T-W, Ting H-F, Wong PWH (2004) New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Proceedings of 10th international computing and combinatorics conference. Lecture notes in computer science, vol 3106. Springer, Berlin, pp 210-218
7. Faigle U, Nawijn WM (1991) Greedy k-coverings of interval orders (Technical Report 979). University of Twente
8. Fung SPY, Chin FYL, Poon CK (2005) Laxity helps in broadcast scheduling. In: Proceedings of 9th Italian conference on theoretical computer science. Lecture notes in computer science, vol 3701. Springer, Berlin, pp 251-264
9. Kim J-H, Chwa K-Y (2004) Scheduling broadcasts with deadlines. Theor Comput Sci 325(3):479-488
10. Koren G, Shasha D (1994) Moca: A multiprocessor on-line competitive algorithm for real-time system scheduling. Theor Comput Sci 128(1-2):75-97
11. over:An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM J Comput 24:318-339
12. Lipton RJ, Tomkins A (1994) Online interval scheduling. In: Proceedings of 5th ACM-SIAM symposium on discrete algorithms, pp 302-311
13. Miyazawa H, Erlebach T (2004) An improved randomized on-line algorithm for a weighted interval selection problem. J Sched 7(4):293-311
14. Seiden SS (1998) Randomized online interval scheduling. Oper Res Lett 22(4-5):171-177
15. Ting H-F (2006) A near optimal scheduler for on-demand data broadcasts. In: Proceedings of 6th Italian conference on algorithms and complexity. Lecture notes in computer science, vol 3998. Springer, Berlin, pp 163-174
16. Woeginger GJ (1994) On-line scheduling of jobs with fixed start and end times. Theor Comput Sci 130(1):5-16
17. Yao AC-C (1977) Probabilistic computations: towards a unified measure of complexity. In: Proceedings of 18th IEEE symposium on foundations of computer science, pp 222-227
18. Zheng F, Fung SPY, Chan W-T, Chin FYL, Poon CK, Wong PWH (2006) Improved on-line broadcast scheduling with deadlines. In: Proceedings of 12th international computing and combinatorics conference. Lecture notes in computer science, vol 4112. Springer, Berlin, pp 320-329