Approximation schemes for preemptive weighted flow time

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 297-305

  Chekuri, Chandra ^a   Khanna, Sanjeev ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIALS; SCHEDULING;

SHORTEST REMAINING PROCESSING TIME; WEIGHTED FLOW TIME;

ALGORITHMS;

EID: 0036041099     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509953.509954     Document Type: Conference Paper

References (15)

1. Approximation schemes for minimizing average weighted completion time with release dates
2. Improved algorithms for stretch scheduling
3. Scheduling to minimize average stretch without migration
4. Algorithms for weighted flow time
5. Formulating the single machine sequencing problem with release dates
6. A supermodular relaxation for scheduling with release dates
7. Scheduling to minimize average completion time: Offline and online algorithms
8. Implementation of SRPT scheduling in web servers
9. Approximability and nonapproximability results for minimizing total flow time on a single machine
10. Complexity of machine scheduling problems
11. Approximating total flow time on parallel machines
12. Online scheduling to minimize average stretch
13. The power of α-points in preemptive single machine scheduling
14. Various optimizers for single-stage production