1. Afrati, F. N., Bampis, E., Chekuri, C., Karger, D. R., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., & Sviridenko, M. (1999). Approximation schemes for minimizing average weighted completion time with release dates. In 40th IEEE computer society annual symposium on foundations of computer science, FOCS (pp. 32–44).
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6604
.
2. Brucker, P. (2010). Scheduling algorithms (5th ed.). Berlin: Springer.
3. Bruno, J., Coffman, E. G, Jr., & Sethi, R. (1974). Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17(7), 382–387.
4. Fishkin, A. V., Jansen, K., & Porkolab, L. (2001). On minimizing average weighted completion time: A PTAS for scheduling general multiprocessor tasks. In 13th FCT 2001, Springer, LNCS, (vol. 2138, pp. 495–507).
5. Garg, N., Kumar, A., & Pandit, V. (2007). Order scheduling models: Hardness and algorithms. In FSTTCS 2007, Springer, LNCS, (vol. 4855, pp 96–107).