1. An application of bin-packing to multiprocessor scheduling;Coffman Jr;SIAM J. Comput.,1978
2. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the theory of NP-Completeness, Freeman, San Francisco, 1979.
3. Bounds on multiprocessor timing anomalies;Graham;SIAM J. Appl. Math.,1969
4. Parallel machines scheduling with nonsimultaneously machine available time;Lee;Discrete Appl. Math.,1991
5. Yue Minyi, On the exact upper bound for the MULTIFIT processor scheduling algorithm, Rept. No. 88547-OR, Institut Für Ökonometrie und Operations Research, Universität Bonn, 1988.