Showing 1 - 1 of 1
The problem of scheduling a task system with communication delays on multiprocessor systems is known to be NP-hard in its general form as well as many restricted cases even on an unlimited number of processors. In this paper, we study the problem of determining an upper bound on the minimum...
Persistent link: https://www.econbiz.de/10010950109