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
Improved on-line broadcast scheduling with deadlines
Journal of 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
Improved online scheduling in maximizing throughput of equal length jobs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Online scheduling with hard deadlines on parallel machines
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
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
Online scheduling of bounded length jobs to maximize throughput
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
On-line scheduling on a single machine: maximizing the number of early jobs
Operations Research Letters
| Hi-index | 0.00 |
We consider online preemptive scheduling problems where jobs have deadlines and the objective is to maximize the total weight 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 may need to be immediately allocated a fixed scheduling interval as well; if these accepted jobs are not eventually completed, the job is lost, and a penalty is incurred. We give an algorithm with the optimal competitive ratio for the first problem, and new and improved algorithms for the second problem, under different models of preemptions and job weights.