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
Admission control with immediate notification
Journal of Scheduling - Special issue: On-line scheduling
Lower bounds on online deadline scheduling with preemption penalties
Information Processing Letters
On Job Scheduling with Preemption Penalties
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Online time constrained scheduling with penalties
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Online scheduling of equal-length jobs on parallel machines
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online scheduling with hard deadlines on parallel machines
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
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
On-line scheduling on a single machine: maximizing the number of early jobs
Operations Research Letters
Competitive analysis for make-to-order scheduling with reliable lead time quotation
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We consider online preemptive scheduling problems where jobs have deadlines and the objective is to maximize the total value of jobs completed before their deadlines. In the first problem, preemptions are not free but incur a penalty. In the second problem, a job has to be accepted or rejected immediately upon arrival, and possibly allocated a fixed scheduling interval as well; if these accepted jobs are eventually not completed they incur a penalty (on top of not getting the value of the job). We give an algorithm with the optimal competitive ratio for the first problem, and new and improved algorithms for the second problem.