Minimum Weighted Completion Time

[1]  Aravind Srinivasan,et al.  Better approximation guarantees for job-shop scheduling , 1997, SODA '97.

[2]  Rajeev Motwani,et al.  Approximation techniques for average completion time scheduling , 1997, SODA '97.

[3]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[4]  Aravind Srinivasan,et al.  Scheduling on Unrelated Machines under Tree-Like Precedence Constraints , 2005, Algorithmica.

[5]  W. A. Horn.  Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

[6]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[7]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[8]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[9]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[10]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[11]  Gerhard J. Woeginger,et al.  A PTAS for minimizing the weighted sum of job completion times on parallel machines , 1999, STOC '99.

[12]  Martin Skutella,et al.  Single Machine Scheduling with Release Dates , 2002, SIAM J. Discret. Math..

[13]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).