1. Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation Schemes for Minimizing AverageWeighted Completion Time with Release Dates. In: Foundations of Computer Science (FOCS), pp. 32–44 (1999)
2. Bansal, N., Dhamdhere, K.: Minimizing Weighted Flow Time. In: ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 508–516 (2003)
3. Bansal, N., Pruhs, K.: Server scheduling in the L p norm: a rising tide lifts all boats. In: ACM Symposium on Theory of Computing (STOC), pp. 242–250 (2003)
4. Becchetti, L., Leonardi, S.: Non-Clairvoyant Scheduling to Minimize the Average Flow Time on Single and Parallel Machines. In: ACM Symposium on Theorey of Computing, STOC (2001)
5. Lecture Notes in Computer Science;L. Becchetti,2001