Publisher
Springer International Publishing
Reference16 articles.
1. Bruno, J.L., Coffman Jr. E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. Assoc. Comput. Mach. 17, 382–387 (1974)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
3. Hoogeveen, H., Schuurman, P., Woeginger, G.J.: Non-approximability results for scheduling problems with minsum criteria. INFORMS J. Comput. 13, 157–168 (2001)
4. Kawaguchi, T., Kyan, S.: Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J. Comput. 15, 1119–1129 (1986)
5. Schulz, A.S., Skutella, M.: Random-based scheduling: New approximations and LP lower bounds. In: Rolim, J. (ed.) Randomization and Approximation Techniques in Computer Science. Lecture Notes in Computer Science, vol. 1269, pp. 119–133. Springer (1997)