1. Bruno, J., Coffman, E.G., & Sethi, R. (1974). Algorithms for minimizing mean flow time. In Information Processing ’74: Processings of the IFIPS Conference (pp. 504–510). North-Holland Publishing Company.
2. Cao, F. (1995). Determining the performance ratio of algorithm MULTIFIT for scheduling, in Nonconvex Optimization Applications, Minimax and applications (Vol. 4, pp. 79–96). Dordrecht: Kluwer Academic Publishers.
3. Chang, S. Y., & Hwang, H. C. (1999). The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines. Discrete Applied Mathematics, 92(2–3), 135–147.
4. Coffman, E. G., Garey, M. R., & Johnson, D. S. (1978). An application of bin-packing to multiprocessor scheduling. SIAM Journal of Computing, 1, 1–17.
5. Coffman, E. G., & Sethi, R. (1976a). Algorithms minimizing mean flowtime: schedule-length properties. Acta Informatica, 6, 1–14.