On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks-Reference-Cited by-同舟云学术

On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks

Published:2001 Issue: Volume: Page:495-507
ISSN:0302-9743
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Fishkin Aleksei V.,Jansen Klaus,Porkolab Lorant

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44669-9_56

Reference20 articles.

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Millis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, Proceedings 40th IEEE Symposium on Foundations of Computer Science (1999), 32–43.

2. Lect Notes Comput Sci;F. Afrati,2000

3. Lect Notes Comput Sci;A. K. Amoura,1997

4. F. Afrati, E. Bampis, C. Kenyon and I. Milis, A PTAS for the average weighted completion time problem on unrelated machines, Journal of Scheduling 3 (2000), 323–332.

5. A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir, On chromatic sums and distributed resource allocation, Information and Computation 140 (1998), 183–202.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scheduling fully parallel jobs;Journal of Scheduling;2018-04-16

2. Scheduling Fully Parallel Jobs with Integer Parallel Units;Lecture Notes in Computer Science;2017

3. Minimizing the total weighted completion time of fully parallel jobs with integer parallel units;Theoretical Computer Science;2013-10

4. Resource Scheduling with Supply Constraint and Linear Cost;Combinatorial Optimization and Applications;2012

5. Parallel Tasks;Scheduling for Parallel Processing;2009