This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 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
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.