1. Bruno, J., Coffman, E. G. Jr., & Sethi, R. (1974). Algorithms for minimizing mean flow time. In Proceedings of IFIP congress 74 (pp. 504–510), Stockholm, Sweden, August 5–10, 1974. North-Holland.
2. Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley.
3. Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
4. Kumar, A., & Kleinberg, J. (2000). Fairness measures for resource allocation. In Proceedings of 41st IEEE symposium on foundations of computer science (pp. 75–85)
5. Lecture notes in computer science;C. Phillips,1995