Moukrim, Aziz - In: Mathematical Methods of Operations Research 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 … for scheduling problems with communication delays. We prove that the minimum number of partitioning paths of the … valid independently of task processing times and communication delays, in the special case when the precedence graph is an …