Lower bounds on online deadline scheduling with preemption penalties

Information Processing Letters

Volumn 108, Issue 4, 2008, Pages 214-218

  Fung, Stanley P Y ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Online algorithms; Preemption penalties; Scheduling

Indexed keywords

COMPETITION; CONTROL THEORY; INDUSTRIAL ECONOMICS; SCHEDULING;

COMPETITIVE RATIOS; DEADLINE SCHEDULING; DETERMINISTIC ONLINE ALGORITHMS; LOWER BOUNDS; ONLINE ALGORITHMS; PREEMPTION PENALTIES;

LAWS AND LEGISLATION;

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

References (11)

1. Baruah S., Koren G., Mao D., Mishra B., Raghunathan A., Rosier L., Shasha D., and Wang F. On the competitiveness of on-line real-time task scheduling. Real-Time Systems 4 (1992) 125-144
2. Hoogeveen H., Potts C.N., and Woeginger G.J. On-line scheduling on a single machine: Maximizing the number of early jobs. Operations Research Letters 27 5 (2000) 193-197
3. Julian F.M., Magazine M.J., and Hall N.G. Generalized preemption models for single-machine dynamic scheduling problems. IIE Transactions 29 (1997) 359-372
4. over: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM Journal on Computing 24 (1995) 318-339
5. Liu Z., and Cheng T.C.E. Scheduling with job release dates, delivery times and preemption penalties. Information Processing Letters 82 2 (2002) 107-111
6. Liu Z., and Cheng T.C.E. Minimizing total completion time subject to job release dates and preemption penalties. Journal of Scheduling 7 4 (2004) 313-327
7. Ting H.-F. A near optimal scheduler for on-demand data broadcasts. Proc. of 6th Italian Conference on Algorithms and Complexity. LNCS vol. 3998 (2006), Springer 163-174
8. Woeginger G.J. On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science 130 1 (1994) 5-16
9. F. Zheng, W. Dai, P. Xiao, Y. Zhao, Competitive strategies for on-line production order disposal problem, in: Proc. of 1st International Conference on Algorithmic Applications in Management, 2005, pp. 46-54
10. Zheng F., Fung S.P.Y., Chan W.-T., Chin F.Y.L., Poon C.K., and Wong P.W.H. Improved on-line broadcast scheduling with deadlines. Proc. of 12th International Computing and Combinatorics Conference. LNCS vol. 4112 (2006), Springer 320-329
11. Zheng F., Xu Y., and Zhang E. On-line production order scheduling with preemption penalties. Journal of Combinatorial Optimization 13 (2007) 189-204