Approximation schemes for preemptive weighted flow time. (English) Zbl 1192.68877
Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 297-305, electronic only (2002).
For the entire collection see [Zbl 1074.68502].
References:
| [1] | F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko. Approximation schemes for minimizing average weighted completion time with release dates. In Proceedings of the 40th Annual IEEE Symposium on Foundation of Computer Science, 1999. |
| [2] | M. Bender, S. Muthukrishnan, and R. Rajaraman. Improved algorithms for stretch scheduling. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002. · Zbl 1093.68549 |
| [3] | L. Becchetti, S. Leonardi, and S. Muthukrishnan. Scheduling to minimize average stretch without migration. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 548-57, 2000. · Zbl 0956.68010 |
| [4] | C. Chekuri, S. Khanna, and A. Zhu. Algorithms for weighted flow time. In Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001. 10.1145/380752.380778 |
| [5] | M. E. Dyer and L. A. Wolsey. Formulating the single machine sequencing problem with release dates. Discrete Applied (MATH)ematics, 26:255-70, 1990. 10.1016/0166-218X(90)90104-K · Zbl 0694.90060 |
| [6] | M. X. Goemans. A supermodular relaxation for scheduling with release dates. In Proceedings of IPCO · Zbl 1414.90149 |
| [7] | L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Offline and online algorithms. (MATH). of Operations Research, 22:513-544, 1997. 10.1287/moor.22.3.513 · Zbl 0883.90064 |
| [8] | M. Harchol-Balter, N. Bansal, and B. Schroeder. Implementation of SRPT Scheduling in Web Servers. Technical Report, Carnegie Mellon University, CMU-CS-00-170, 2000. |
| [9] | R. Jain. The Art of Computer Systems Performance Analysis. John Wiley, New York, 1991. · Zbl 0824.68013 |
| [10] | H. Kellerer, T. Tautenhahn, and G. J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 418-426, May 1996. 10.1145/237814.237989 · Zbl 0915.90151 |
| [11] | J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete (MATH)ematics, 1:343-362, 1977. · Zbl 0353.68067 |
| [12] | S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 110-119, 1997. 10.1145/258533.258562 · Zbl 0962.68007 |
| [13] | S. Muthukrishnan, R. Rajaraman, R. Shaheen, and J. Gehrke. Online scheduling to minimize average stretch. In Proceeding of the 4oth Annual IEEE Symposium on Foundations of Computer Science, pages 433-43, 1999. |
| [14] | A. Schulz and M. Skutella. The power of α-points in preemptive single machine scheduling. To appear in Journal of Scheduling. |
| [15] | W. E. Smith. Various optimizers for single-stage production. Naval Res. Logist. Quart., 3:59-66, 1956. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
