On-line scheduling with tight deadlines
Theoretical Computer Science - Mathematical foundations of computer science
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Scheduling broadcasts with deadlines
Theoretical Computer Science - Special papers from: COCOON 2003
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing
A survey of buffer management policies for packet switches
ACM SIGACT News
Improved on-line broadcast scheduling with deadlines
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Online scheduling of bounded length jobs to maximize throughput
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online scheduling with preemption or non-completion penalties
Journal of Scheduling
| Hi-index | 0.00 |
Motivated by issues raised from data broadcast and networks using ATM and TCP/IP, we consider an online scheduling problem on a single machine. In the problem, each job i is revealed at release time ri, has processing time pi, deadline di and weight wi. Preemption is allowed and there are two models of preemption: preemption with restart and preemption with resume. The goal is to maximize the throughput -- the total weight of all jobs completed on time. In the paper, we consider the problem where all processing time of jobs are equal and present improved algorithms which achieve 4.24-competitive in both models of preemption.