1. [1] Kasahara, H. and Narita, S.: Practical multiprocessor scheduling algorithms for efficient parallel processing, IEEE Trans. Computers, Vol.C-33, No, 11, pp.1023-1029 (1984).
2. [2] Fujita, S.: A branch-and-bound algorithm for solving the multiprocessor scheduling problem with improved lower bounding techniques, IEEE Trans. Computers, Vol.60, No.7, pp.1006-1016 (2011).
3. [3] Sinnen, O., Kozlov, A.V. and Shahul, A.Z.S.: Optimal scheduling of task graphs on parallel systems, Proc. 9th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), pp.323-328 (2008).
4. [4] Kwok, Y.K. and Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Computing Surveys (CSUR), Vol.31, No.6, pp.406-471 (1999).
5. [5] Hwang, J.J., Chow, Y.C., Anger, F.D. and Lee, C.Y.: Scheduling precedence graph in systems with interprocessor communication times, SIAM Journal of Computing, Vol.18, No.2, pp.244-257 (1989).