1. H. El-Rewini, T. G. Lewis, and H. H. Ali, Task Scheduling in Parallel and Distributed Systems. Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1994.
2. N. Immerman, “Expressibility and parallel complexity,” SIAM Journal on Computing, vol. 18, no. 3, pp. 625–638, 1989.
3. J. C. Wyllie, “The complexity of parallel computations,” Cornell University, Tech. Rep., 1979.
4. E. G. Coffman and J. L. Bruno, Computer and job-shop scheduling theory. John Wiley & Sons, 1976.
5. O. H. Ibarra and C. E. Kim, “Heuristic algorithms for scheduling independent tasks on nonidentical processors,” J. ACM, vol. 24, no. 2, pp. 280–289, Apr. 1977. [Online]. Available: http://doi.acm.org/10.1145/322003.322011