TY - GEN
T1 - Approximation algorithms for the job interval selection problem and related scheduling problems
AU - Chuzhoy, J.
AU - Ostrovsky, R.
AU - Rabani, Y.
PY - 2001
Y1 - 2001
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 2-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. Our methods can be used to give improved bounds for some related resource allocation problems that were considered recently in the literature.
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 2-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. Our methods can be used to give improved bounds for some related resource allocation problems that were considered recently in the literature.
UR - https://www.scopus.com/pages/publications/0035179608
U2 - 10.1109/sfcs.2001.959909
DO - 10.1109/sfcs.2001.959909
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0035179608
SN - 0769513905
T3 - Annual Symposium on Foundations of Computer Science - Proceedings
SP - 348
EP - 356
BT - Proceedings - 42nd IEEE Symposium on Foundations of Computer Science, FOCS 2001
PB - IEEE Computer Society
T2 - 42nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2001
Y2 - 14 October 2001 through 17 October 2001
ER -