A Note on Scheduling Equal-Length Jobs to Maximize Throughput
Marek Chrobak, Christoph Durr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski
Abstract
We study the problem of scheduling equal-length jobs with release times and deadlines, where the objective is to maximize the number of completed jobs. Preemptions are not allowed. In Graham's notation, the problem is described as 1|rj;pj=p|Σ Uj. We give the following results: (1) We show that the often cited algorithm by Carlier from 1981 is not correct. (2) We give an algorithm for this problem with running time O(n5).
Create a lesson
Related papers
State Evolution and Universality of Iterated Linear Programs for the Binary Perceptron
Jianan Zhang, Shuangping Li
Metric TSP in Sublinear Time: Breaking Two Approximation
Amir Azarmehr, Soheil Behnezhad
Testing Implies Distance Estimation with Polynomial Loss
Gaia Carenini, Cameron Seth
Online Metric Matching with Unknown i.i.d. Arrivals
Tsubasa Harada
Incremental Open Addressing Has No Time-Space Tradeoff
Martín Farach-Colton, Andrew Krapivin, William Kuszmaul
A Constant-Factor Approximation for Capacitated Facility Location with Outliers
Rajni Dabas