List Scheduling of Parallel Tasks

We are concerned with nonreconfigurable nonpreemptive scheduling policies, i.e., once a task has been started, its scheduled parallelism cannot be changed, nor can the task be preempted.

[1]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.

[2]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[3]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..