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 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
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
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
We consider the non-preemptive 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 ${\it P}2 \mid {p_j = p,r_j} \mid {\sum \overline{U}_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 $\frac{3}{2}$-competitive. A simple lower bound shows that this is the optimal deterministic competitiveness