
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
Keywords: پیچیدگی; Complexity; Divide-and-conquer graph; HLF; Identical parallel processors; Makespan