A fast algorithm for multiprocessor scheduling of unit-length jobs
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Online scheduling with hard deadlines
Journal of Algorithms
Patience is a virtue: the effect of slack on competitiveness for admission control
Journal of Scheduling - Special issue: On-line algorithm part I
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 scheduling with hard deadlines on parallel machines
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
Information Processing Letters
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
Approximation and Online Algorithms
Dispatching equal-length jobs to parallel machines to maximize throughput
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
We consider the nonpreemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclature, this problem is denoted as P2 | pj = p,rj | ∑ &Uhorbar;j. The problem is known to be polynomially solvable in an offline setting. In an online variant of the problem, a job's existence and parameters are revealed to the scheduler only upon that job's release date. We present an online deterministic algorithm for the problem and prove that it is 3/2-competitive. A simple lower bound shows that this is the optimal deterministic competitiveness.