J. Chuzhoy, R. Ostrovsky and Y. Rabani, "Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems," in IEEE Symposium on Foundations of Computer Science(FOCS), pp.348356, 2001 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fourteen Notes on Equal-Processing-Time Scheduling - Baptiste, Brucker, Knust (2002) (Correct)
....implies that the problem can be solved by dynamic programming in polynomial time. 9 Pmjr j ; p j We describe a decomposition scheme that follows the technique used earlier for 1jr j ; p j = pj w j U j [1] Pmjr j ; p j = pj w j C j , Pmjr j ; p j = pj T j [2] and a suggestion in [10]. Let us de ne a resource pro le to be a vector a = a 1 ; a 2 ; am ) with integral components in T such that a max a min p, and the components associated with the machines M 1 ; M 2 ; Mm . We assume that a min is the completion time of a job, a i = a min implies that a i is ....
J. Chuzhoy, R. Ostrovsky and Y. Rabani, Approximation algorithms for the job interval selection problem and related scheduling problems, Proc. 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, 2001.
Interval selection: Applications, algorithms, and lower bounds - Erlebach, Spieksma (Correct)
....of [3] Berman and DasGupta [4] and Bar Noy et al. 2] proposed combinatorial two phase algorithms that also achieve ratio 2 for WJISP 1 and, by repeated application, 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) #. The on line variant of TCSP is studied in Goldman et al. 15] and Goldwasser [16] in the singlemachine case. The weight of a job is equal to its length and ....
J. Chuzhoy, R. Ostrovsky, and Y. Rabani. Approximation algorithms for the job interval selection problem and related scheduling problems. In Proceedings of the 42nd Annual Symposium on Foundations of Compute Science FOCS'01, 2001.
Throughput Maximization of Real-Time Scheduling with.. - Bar-Noy, Guha, Katz.. (Correct)
....families to have different lengths, the problem becomes NP complete, even when the release dates and due dates can take only two values each [GJ 79] 1. 3 Related 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 discrete or a continuous fashion) This model captures many applications, e.g. scheduling a space mission, bandwidth allocation, and communication in a linear ....
....or a continuous fashion) This model captures many applications, e.g. scheduling a space mission, bandwidth allocation, and communication in a linear network. The approximation factor obtained is 2 (and 2 for the continuous case) Very recently, the approximation factor was improved in [COR 01] to (e= e Gamma 1) for the unweighted version of the problem, where is some constant. We define the approximation ratio as the ratio of the optimum solution to the solution given by the algorithm. By this definition the approximation factor of any algorithm is always at least 1. In the ....
J. Chuzhoy, R. Ostrovsky, and Y. Rabani. "Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems." In FOCS '01.
New Hardness Results for Congestion Minimization and Machine.. - Chuzhoy, Naor (2004) (2 citations) Self-citation (Chuzhoy) (Correct)
No context found.
J. Chuzhoy, R. Ostrovsky, and Y. Rabani. Approximation algorithms for the job interval selection problem and related scheduling problems. In IEEE Symposium on Foundations of Computer Science, pages 348--356, 2001.
Maximizing Throughput for Optical Burst Switching Networks - Li, Qiao, Xu, Xu (2004) (Correct)
No context found.
J. Chuzhoy, R. Ostrovsky and Y. Rabani, "Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems," in IEEE Symposium on Foundations of Computer Science(FOCS), pp.348356, 2001
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