Admission control with immediate notification
Journal of Scheduling - Special issue: On-line scheduling
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing
Online nonpreemptive scheduling of equal-length jobs on two identical machines
ACM Transactions on Algorithms (TALG)
Online, non-preemptive scheduling of equal-length jobs on two identical machines
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Dispatching equal-length jobs to parallel machines to maximize throughput
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 0.89 |
We consider the online problem of scheduling jobs with equalprocessing times on a single machine. Each job has a release timeand a deadline, and the goal is to maximize the number of jobscompleted by their deadlines. Chrobak et al. (2007, SICOMP 36:6)introduce a preempt-restart model in which progress towardcompleting a preempted job is lost, yet that job can be restartedfrom scratch. They provide a 3/2-competitive deterministicalgorithm and show that this is the optimal competitiveness. Theiranalysis is based on a complex charging scheme among individualjobs and the use of several partial functions and mappings forassigning the charges. In this paper, we provide an alternativeproof of the result using a more global potential argument tocompare the relative progress of the algorithm versus the optimalschedule over time. This new proof is significantly simpler andmore intuitive that the original, and our technique is applicableto related problems.