|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
40th Annual Symposium on Foundations of Computer Science
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
New York, New York
October 17-October 18
ISBN: 0-7695-0409-4
| ASCII Text | x | ||
| Foto Afrati, Evripidis Bampis, Chandra Chekuri, David Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Cliff Stein, Maxim Sviridenko, "Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates," Foundations of Computer Science, IEEE Annual Symposium on, pp. 32, 40th Annual Symposium on Foundations of Computer Science, 1999. | |||
| BibTex | x | ||
| @article{ 10.1109/SFFCS.1999.814574, author = {Foto Afrati and Evripidis Bampis and Chandra Chekuri and David Karger and Claire Kenyon and Sanjeev Khanna and Ioannis Milis and Maurice Queyranne and Martin Skutella and Cliff Stein and Maxim Sviridenko}, title = {Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1999}, issn = {0272-5428}, pages = {32}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814574}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates SN - 0272-5428 SP EP A1 - Foto Afrati, A1 - Evripidis Bampis, A1 - Chandra Chekuri, A1 - David Karger, A1 - Claire Kenyon, A1 - Sanjeev Khanna, A1 - Ioannis Milis, A1 - Maurice Queyranne, A1 - Martin Skutella, A1 - Cliff Stein, A1 - Maxim Sviridenko, PY - 1999 KW - average weighted completion time KW - scheduling KW - release dates KW - approximation scheme KW - parallel machines KW - algorithm VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel machines and a constant number of unrelated machines with and without preemption allowed. Our schemes are efficient: for all variants the running time for a \math approximation is of the form \math poly(n).
Index Terms:
average weighted completion time, scheduling, release dates, approximation scheme, parallel machines, algorithm
Citation:
Foto Afrati, Evripidis Bampis, Chandra Chekuri, David Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Cliff Stein, Maxim Sviridenko, "Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates," focs, pp.32, 40th Annual Symposium on Foundations of Computer Science, 1999
Usage of this product signifies your acceptance of the Terms of Use.
