Moukrim, Aziz - In: Computational Statistics 52 (2000) 1, pp. 99-113
The problem of scheduling a task system with communication delays on multiprocessor systems is known to be NP-hard in … problem of determining an upper bound on the minimum number of processors achieved by a schedule that minimizes the makespan … for scheduling problems with communication delays. We prove that the minimum number of partitioning paths of the …