A tight lower bound for job scheduling with cancellation

Information Processing Letters

Volumn 97, Issue 1, 2006, Pages 1-3

  Zheng, Feifeng ^a   Chin, Francis Y L ^b   Fung, Stanley P Y ^b   Poon, Chung Keung ^c   Xu, Yinfeng ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Lower bounds; On line algorithms; Scheduling

Indexed keywords

JOB SCHEDULING; LOWER BOUNDS; ON-LINE ALGORITHMS;

ALGORITHMS; DATA PROCESSING; JOB ANALYSIS; ONLINE SYSTEMS; PROBLEM SOLVING;

SCHEDULING;

EID: 27844494751     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.09.001     Document Type: Article

References (5)

1. A. Borodin, and R. El-yaniv Online Computation and Competitive Analysis 1998 Cambridge University Press Cambridge
2. W.-T. Chan, T.-W. Lam, H.-F. Ting, and P.W.H. Wong New results on on-demand broadcasting with deadline via job scheduling with cancellation Proc. 10th Internat. Computing and Combinatorics Conference Lecture Notes in Comput. Sci. vol. 3106 2004 Springer Berlin 210 218
3. J.-H. Kim, and K.-Y. Chwa Scheduling broadcasts with deadlines Proc. 9th Internat. Computing and Combinatorics Conference Lecture Notes in Comput. Sci. vol. 2697 2003 Springer Berlin 415 424
4. G.J. Woeginger On-line scheduling of jobs with fixed start and end times Theoret. Comput. Sci. 130 1994 5 16
5. F. Zheng, S.P.Y. Fung, F.Y.L. Chin, C.K. Poon, Y. Xu, Improved on-line broadcast scheduling with deadlines, Manuscript, 2004