Moukrim, Aziz - In: Mathematical Methods of Operations Research 52 (2000) 1, pp. 99-113
problem of determining an upper bound on the minimum number of processors achieved by a schedule that minimizes the makespan … precedence graph is an upper bound on the minimum number of processors for UET-UCT (Unit Execution Time-Unit Communication Time …
