1. E. G. Coffman, M. R. Garey, and D. S. Johnson,An application of bin-packing to multiprocessor scheduling, SIAM J. Comput., vol. 7, no. 1, Feb. 1978, 1–17.
2. E. G. Coffman and Ravi Sethi,A generalized bound on LPT scheduling, Revue française d'automatique informatique recherche operationelle, vol. 10, no. 5, May 1976, pp. 17–25.
3. E. G. Coffman, ed.,Computer and job/shop scheduling theory, John Wiley, New York, 1976.
4. M. R. Garey and D. S. Johnson,Computers and intractability, Freeman, San Francisco, 1979.
5. R. L. Graham,Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math. 17 (1969), pp. 416–429.