Scheduling to Minimize the Average Completion Time of Dedicated Tasks-Reference-Cited by-同舟云学术

Scheduling to Minimize the Average Completion Time of Dedicated Tasks

Published:2000 Issue: Volume: Page:454-464
ISSN:0302-9743
Container-title:FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science
language:
Short-container-title:

Author:

Afrati Foto,Bampis Evripidis,Fishkin Aleksei V.,Jansen Klaus,Kenyon Claire

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44450-5_37

Reference7 articles.

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes forminimizing average weighted completion time with release dates, 40th Annual Symposiumon Foundations of Computer Science (FOCS’99), 1999, 32–43.

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

3. P. Brucker, A. Krämer, Polynomial algorithms for resource constrained and multi processortask scheduling problems, European Journal of Operational Research, 90(1996) 214–226.

4. X. Cai, C.-Y. Lee, C.-L. Li, Minimizing total completion time in two-processor task systems with prespecified processor allocations, Naval Research Logistics, 45 (1998)231–242.

5. R. L. Graham, E. L. Lawler, J. K. Lenstra, K. Rinnooy Kan, Optimization and Approximation in Deterministic Scheduling: A Survey, Annals Discrete Mathematics,5 (1979) 287–326.

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

1. Job Scheduling Using Successive Linear Programming Approximations of a Sparse Model;Euro-Par 2012 Parallel Processing;2012

2. Sum edge coloring of multigraphs via configuration LP;ACM Transactions on Algorithms;2011-03

3. Parallel Tasks;Scheduling for Parallel Processing;2009

4. Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria;Approximation and Online Algorithms;2005

5. Multicoloring: Problems and Techniques;Lecture Notes in Computer Science;2004