Online interval scheduling: randomized and multiprocessor cases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4598 LNCS, Issue , 2007, Pages 176-186

  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

[No Author keywords available]

Indexed keywords

ONLINE SYSTEMS; PROBLEM SOLVING; SCHEDULING ALGORITHMS;

COMPETITIVE RATIO; ONLINE INTERVAL SCHEDULING; RANDOMIZED ALGORITHM;

MULTIPROCESSING SYSTEMS;

EID: 37849045000     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73545-8_19     Document Type: Conference Paper

References (16)

1. Awerbuch, B., Bartal, Y., Fiat, A., Rosen, A.: Competitive non-preemptive call control. In: Proc. 5th SODA, pp. 312-320 (1994)
2. Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D., Wang, F.: On the competitiveness of on-line real-time task scheduling. Real-Time Systems 4, 125-144 (1992)
3. Bogart, K.P., West, D.B.: A short proof that proper = unit. Discrete Mathematics 201, 21-23 (1999)
4. Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing 27(4), 993-1015 (1998)
5. Chan, W.-T., Lam, T.-W., Ting, H.-F., Wong, P.W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 210-218. Springer, Heidelberg (2004)
6. Faigle, U., Nawijn, W.M.: Greedy k-coverings of interval orders. Technical Report 979, University of Twente (1991)
7. Fung, S.P.Y., Chin, F.Y.L., Poon, C.K.: Laxity helps in broadcast scheduling. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol. 3701, pp. 251-264. Springer, Heidelberg (2005)
8. Kim, J.-H., Chwa, K.-Y.: Scheduling broadcasts with deadlines. Theoretical Computer Science 325(3), 479-488 (2004)
9. over: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM Journal on Computing 24, 318-339 (1995)
10. Koren, G., Shasha, D.: MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling. Theoretical Computer Science 128(1-2), 75-97 (1994)
11. Lipton, R.J., Tomkins, A.: Online interval scheduling. In: Proc. 5th SODA, pp. 302-311 (1994)
12. Miyazawa, H., Erlebach, T.: An improved randomized on-line algorithm for a weighted interval selection problem. Journal of Scheduling 7(4), 293-311 (2004)
13. Seiden, S.S.: Randomized online interval scheduling. Operations Research Letters 22(4-5), 171-177 (1998)
14. Ting, H.-F.: A near optimal scheduler for on-demand data broadcasts. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 163-174. Springer, Heidelberg (2006)
15. Woeginger, G. J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science 130(1), 5-16 (1994)
16. Zheng, F., Fung, S.P.Y., Chan, W.-T., Chin, F.Y.L., Poon, C.K., Wong, P.W.H.: Improved on-line broadcast scheduling with deadlines. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 320-329. Springer, Heidelberg (2006)