On the competitiveness of on-line real-time task scheduling
Real-Time Systems
On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
Scheduling with job release dates, delivery times and preemption penalties
Information Processing Letters
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties
Journal of Scheduling
Improved on-line broadcast scheduling with deadlines
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Competitive strategies for on-line production order disposal problem
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
A near optimal scheduler for on-demand data broadcasts
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On Job Scheduling with Preemption Penalties
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Online preemptive scheduling with immediate decision or notification and penalties
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Online deadline scheduling with preemption penalties
Computers and Industrial Engineering
Online scheduling with preemption or non-completion penalties
Journal of Scheduling
| Hi-index | 0.89 |
We generalize and improve previous results of online preemptive deadline scheduling with preemption penalties. We consider both the preemption-restart and the preemption-resume models, and give new or improved lower bounds on the competitive ratio of deterministic online algorithms. In many cases the bounds are optimal when the job deadlines are tight. Our results show that the competitiveness varies linearly with the penalty factor.