1. Shahid H. Bokhari,A Comparative Analysis of Static and Dynamic Load Balancing Strategies, In proceedings of the 1986 International Conference on Parallel Processing, pp 1040–1047, August 1986.
2. E. G. Coffman,Computer and Job-Shop Scheduling Theory, John Wiley & Sons, New York, 1976.
3. R. L. Graham,Bounds for certain multiprocessor timing anomalies, SIAM Journal of Applied Mathematics, 17, 2 (1969), pp 416–429.
4. R. L. Graham, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan,Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, pp 287–326, No 5, 1979.
5. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys,Sequencing and scheduling: Algorithms and complexity, In S. C. Graves, A. H. G. Rinnooy Kan and P. Zipkin, editors.Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory. North-Holland, Amsterdam 1989.