TY - JOUR
T1 - Approximation algorithms for the job interval selection problem and related scheduling problems
AU - Chuzhoy, Julia
AU - Ostrovsky, Rafail
AU - Rabani, Yuval
PY - 2006/11
Y1 - 2006/11
N2 - In this paper we consider the job interval selection problem (JISP), a simple scheduling model with a rich history and numerous applications. Special cases of this problem include the so-called real-time scheduling problem (also known as the throughput maximization problem) in single- and multiple-machine environments. In these special cases we have to maximize the number of jobs scheduled between their release date and deadline (preemption is not allowed). Even the single-machine case is NP-hard. The unrelated machines case, as well as other special cases of JISP, are MAX SNP-hard. A simple greedy algorithm gives a two-approximation for JISP. Despite many efforts, this was the best approximation guarantee known, even for throughput maximization on a single machine. In this paper, we break this barrier and show an approximation guarantee of less than 1.582 for arbitrary instances of JISP. For some special cases, we show better results.
AB - In this paper we consider the job interval selection problem (JISP), a simple scheduling model with a rich history and numerous applications. Special cases of this problem include the so-called real-time scheduling problem (also known as the throughput maximization problem) in single- and multiple-machine environments. In these special cases we have to maximize the number of jobs scheduled between their release date and deadline (preemption is not allowed). Even the single-machine case is NP-hard. The unrelated machines case, as well as other special cases of JISP, are MAX SNP-hard. A simple greedy algorithm gives a two-approximation for JISP. Despite many efforts, this was the best approximation guarantee known, even for throughput maximization on a single machine. In this paper, we break this barrier and show an approximation guarantee of less than 1.582 for arbitrary instances of JISP. For some special cases, we show better results.
KW - Approximation algorithms
KW - PTAS
KW - Scheduling
KW - Throughput
UR - http://www.scopus.com/inward/record.url?scp=33847180847&partnerID=8YFLogxK
U2 - 10.1287/moor.1060.0218
DO - 10.1287/moor.1060.0218
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33847180847
SN - 0364-765X
VL - 31
SP - 730
EP - 738
JO - Mathematics of Operations Research
JF - Mathematics of Operations Research
IS - 4
ER -