Online scheduling with hard deadlines
Journal of Algorithms
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing
On-line bipartite matching made simple
ACM SIGACT News
Online nonpreemptive scheduling of equal-length jobs on two identical machines
ACM Transactions on Algorithms (TALG)
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
Dispatching equal-length jobs to parallel machines to maximize throughput
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
Consider scheduling of unit jobs with release times and deadlines on m identical machines with the objective to maximize the number of jobs completed before their deadlines. We prove a new lower bound for online algorithms with immediate decision. This means that the jobs arrive over time and the algorithm has to decide the schedule of each job immediately upon its release. Our lower bound tends to e/(e − 1) ≅ 1.58 for many machines, matching the performance of the best algorithm.