Julia Chuzhoy, Rafail Ostrovsky, et al.  Home/Search
Context Related
| ucla.edu/~rafail/PUBLIC/56.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucla.edu/~rafail/PUBLIC/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Context of citations to this paper: More
.... Work Maximizing the throughput in real time scheduling without batching was studied extensively in [S 99, BB 00, BD 00, BG 01, COR 01] All of these papers focused on the case where jobs specify more than one time interval in which they can be performed (in either a...
...ratio #(m) for WJISPm . These algorithms do not belong to the class of single pass algorithms. For the case of JISP, Chuzhoy et al. [8] improved the known ratios further and showed that for every # 0, there is a randomized approximation algorithm with ratio e (e 1)...
Cited by: More
Maximizing Throughput for Optical Burst Switching Networks - Li, Qiao, Xu, Xu (2004) (Correct)
New Hardness Results for Congestion Minimization and Machine.. - Chuzhoy, Naor (2004) (Correct)
Fourteen Notes on Equal-Processing-Time Scheduling - Baptiste, Brucker, Knust (2002) (Correct)
Similar documents (at the sentence level):
75.9%: Approximation Algorithms for the Job Interval Selection.. - Chuzhoy, Ostrovsky (Correct)
Active bibliography (related documents): More All
0.9: Approximating the Throughput of Multiple Machines in.. - Bar-Noy, Guha, Naor.. (Correct)
0.3: Multi-phase Algorithms for Throughput Maximization for.. - Berman, DasGupta (2000) (Correct)
0.3: Improvements in Throughput Maximization for Real-Time.. - Berman, DasGupta (2000) (Correct)
Similar documents based on text: More All
0.3: Asymmetric k-Center is log* n-hard to Approximate - Chuzhoy, Guha, Khanna, Naor (2003) (Correct)
0.1: Order-Based Inference in Natural Logic - Fyodorov, Winter, Francez (Correct)
0.1: Minimizing the Flow Time for Parallelizable Task Systems - Glasgow, Shachnai (1993) (Correct)
Related documents from co-citation: More All
3: Multi-phase algorithms for throughput maximization for real-time scheduling - Berman, DasGupta - 2000
2: Approximation Algorithms for NP-hard Problems (context) - Hochbaum - 1997
2: A unified approach to approximating resource allocation and schedualing (context) - Bar-Noy, Bar-Yehuda et al. - 2000
BibTeX entry: (Update)
J. Chuzhoy, R. Ostrovsky, and Y. Rabani. "Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems." In FOCS '01. http://citeseer.ist.psu.edu/chuzhoy01approximation.html More
@inproceedings{ chuzhoy01approximation,
author = "Julia Chuzhoy and Rafail Ostrovsky and Yuval Rabani",
title = "Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "348-356",
year = "2001",
url = "citeseer.ist.psu.edu/chuzhoy01approximation.html" }
Citations (may not include all citations):488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
204 Sequencing and Scheduling: Algorithms and Complexity (context) - Lawler, Lenstra et al.
73 Online interval scheduling - Lipton, Tomkins - 1994
52 the competitiveness of on-line real-time task scheduling - Baruah, Koren et al. - 1992
51 Adaptive rate-controlled scheduling for multimedia applicati.. - Yau, Lam - 1996
44 Algorithms for scheduling independent tasks (context) - Sahni - 1976
44 Scheduling a production line to minimize maximum tardiness (context) - Jackson - 1955
43 Two processor scheduling with start times and deadlines (context) - Garey, Johnson - 1977
25 one machine sequencing algorithm for minimizing the number o.. (context) - Moore - 1968
19 Adaptive source rate control for real-time wireless video tr.. - Liu, Zarki - 1998
19 A solvable case of one machine scheduling problem with ready.. (context) - Kise, Ibaraki et al. - 1978
17 The assembly of printed circuit boards: a case with multiple.. - Crama, Flippo et al. - 1997
16 Scheduling time-constrained communication in linear networks - Adler, Rosenberg et al. - 1998
14 Polynomial time algorithms for minimizing the weighted numbe.. (context) - Baptiste - 1999
12 An optimal on-line scheduling algorithm for overloaded real-.. (context) - Koren, Shasha - 1995
12 Maximizing the value of a space mission (context) - Hall, Magazine - 1994
9 Sequencing to minimize the weighted number of tardy jobs (context) - Lawler - 1976
8 Note on scheduling intervals on-line (context) - Faigle, Nawijn - 1995
7 the approximability of an interval scheduling problem (context) - Spieksma - 1999
7 robust video communication over packet wireless networks (context) - Rajugopal, Hafez et al. - 1998
7 Approximating the throughput of multiple machines in real-ti.. (context) - Bar-Noy, Guha et al. - 1999
4 A uni ed approach to approximating resource allocation and s.. (context) - Bar-Noy, Bar-Yehuda et al. - 2000
4 Private Communication (context) - Freund
3 Improvements in throughput maximiztion for real-time schedul.. (context) - Berman, DasGupta - 2000
3 The xed job schedule problem with spread-time constraints (context) - Fischetti, Martello et al. - 1987
3 Volume 4: Logistics for Production and Inventory (context) - Graves, Kan et al. - 1993
2 Scheduling jobs with xed start and end times Discrete Applie.. (context) - Arkin, Silverberg - 1987
1 a une machine et algorithmes polyn^omiaux (context) - Carlier, eme - 1981
Documents on the same site (http://www.cs.ucla.edu/~rafail/PUBLIC/index.html): More
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) (Correct)
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC