1. G. I. Chen and T. H. Lai, “Preemptive Scheduling of Independent Jobs on a Hypercube System,” in preparation.
2. M. S. Chen and K. G. Shin, “Determination of a Minimal Subcube for Interacting Task Modules,” to appear in Hypercube Multiprocessors 1987, M. Heath editor, SIAM, Philadelphia, 1987.
3. Y. Cho and S. Sahni, “Bounds for List Schedules on Uniform Processors,” SIAM J. Comput., Vol. 9, No. 1, Feb. 1980, pp. 91–103.
4. M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
5. T. Gonzalez, O. H. Ibarra and S. Sahni, “Bounds for LPT schedules on Uniform Processors,” SIAM J. Comput., Vol. 6, No. 1, Mar. 1977, pp. 155–166.