Online preemptive scheduling with immediate decision or notification and penalties

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

Volumn 6196 LNCS, Issue , 2010, Pages 389-398

  Fung, Stanley P Y ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

IMPROVED ALGORITHM; OPTIMAL COMPETITIVE RATIOS; PRE-EMPTIVE SCHEDULING; SCHEDULING INTERVAL; TOTAL VALUES;

EID: 77955046705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14031-0_42     Document Type: Conference Paper

References (13)

1. 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)
2. Ding, J., Ebenlendr, T., Sgall, J., Zhang, G.: Online scheduling of equal-length jobs on parallel machines. In: Proc. of 15th ESA, pp. 427-438 (2007)
3. Ding, J., Zhang, G.: Online scheduling with hard deadlines on parallel machines. In: Proc. of 2nd AAIM, pp. 32-42 (2006)
4. Ebenlendr, T., Sgall, J.: A lower bound for scheduling of unit jobs with immediate decision on parallel machines. In: Proc. of 6th WAOA, pp. 43-52 (2008)
5. Fung, S.P.Y.: Lower bounds on online deadline scheduling with preemption penalties. Information Processing Letters 108(4), 214-218 (2008)
6. Goldwasser, M.H., Kerbikov, B.: Admission control with immediate notification. J. of Scheduling 6, 269-285 (2003)
7. Hoogeveen, H., Potts, C.N., Woeginger, G.J.: On-line scheduling on a single machine: Maximizing the number of early jobs. Operations Research Letters 27(5), 193-197 (2000)
8. Koren, G., Shasha, D.: Dover: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM J. on Computing 24, 318-339 (1995)
9. Thibault, N., Laforest, C.: Online time constrained scheduling with penalties. In: Proc. of 23rd IEEE Int. Symposium on Parallel and Distributed Processing (2009)
10. Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science 130(1), 5-16 (1994)
11. Zheng, F., Dai, W., Xiao, P., Zhao, Y.: Competitive strategies for on-line production order disposal problem. In: Megiddo, N., Xu, Y., Zhu, B. (eds.) AAIM 2005. LNCS, vol.3521, pp. 46-54. Springer, Heidelberg (2005)
12. 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)
13. Zheng, F., Xu, Y., Poon, C.K.: On job scheduling with preemption penalties. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol.5564, pp. 315-325. Springer, Heidelberg (2009)