1. An application of Bin-Packing to multiprocessor scheduling;Coffman;SIAM Journal on Computing,1978
2. Bounds on the performance of scheduling algorithms;Graham;SIAM Journal on Applied Mathematics,1969
3. J.L. Jimeno, E. Mokotoff, J. Pérez, A constructive algorithm to minimise the makespan on identical parallel machine, in: Eighth International Workshop on Project Management and Scheduling, Valencia, 2002
4. M. Jünger, G. Reinelt, S. Thienel, Practical problem solving with cutting plane algorithms in combinatorial optimization, in: W. Cook, L. Lovász, P. Seymour (Eds.), Combinatorial Optimization, Dimacs, Vol. 20, 1995, 111–152
5. J.K. Lenstra, A.H.G. Rinnooy Kan, Computational complexity of discrete optimization, in: J.K. Lenstra, A.H.G. Rinnooy Kan, P. Van Emde Boas (Eds.), Interfaces between Computer Science and Operations Research, Proceedings of a Symposium held at the Matematisch Centrum, Amsterdam, 1979, 64–85