Highly Influenced

# Approximation Schemes for Preemptive Weighted Flow Time

@inproceedings{Chekuri2001ApproximationSF, title={Approximation Schemes for Preemptive Weighted Flow Time}, author={Chandra Chekuri and Sanjeev Khanna}, booktitle={Electronic Colloquium on Computational Complexity}, year={2001} }

- Published 2001 in Electronic Colloquium on Computational Complexity
DOI:10.1145/509907.509954

(MATH) We present the first approximation schemes for minimizing weighted flow time on a single machine with preemption. Our first result is an algorithm that computes a (1+ε)-approximate solution for any instance of weighted flow time in <i>O</i>(<i>n</i><sup>O(ln <i>W</i> ln <i>P</i>/ε<sup>3</sup>)</sup>) time; here <i>P</i> is the ratio of maximum job processing time to minimum job processing time, and <i>W</i> is the ratio of maximum job weight to minimum job weight. This result directly… CONTINUE READING

Highly Cited

This paper has 50 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

33 Citations

3 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### fewer than 50 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**50**citations based on the available data.See our **FAQ** for additional information.

#### References

##### Publications referenced by this paper.

Showing 1-3 of 3 references

Highly Influential