Throughput maximization of real-time scheduling with batching
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem
Journal of Scheduling
New hardness results for congestion minimization and machine scheduling
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
New hardness results for congestion minimization and machine scheduling
Journal of the ACM (JACM)
Algorithmic aspects of bandwidth trading
ACM Transactions on Algorithms (TALG)
Maximizing throughput for optical burst switching networks
IEEE/ACM Transactions on Networking (TON)
Algorithmic aspects of bandwidth trading
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Real-time scheduling with a budget
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Min sum edge coloring in multigraphs via configuration LP
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Computers and Operations Research
Energy efficient scheduling via partial shutdown
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Strip graphs: recognition and scheduling
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Pickup and delivery for moving objects on broken lines
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Efficient job scheduling algorithms with multi-type contentions
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Priority algorithms for the subset-sum problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Interval selection with machine-dependent intervals
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
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.