Complexity and approximation results for
β
Giuseppe Confessore; Paolo Dell'Olmo; Stefano Giordani
π
Article
π
2003
π
Elsevier Science
π
English
β 398 KB
We study a multiprocessor task scheduling problem, in which each task requires a set of processors with consecutiveness constraints to be executed. This occurs, for example, when multiple processors are interconnected by communication means, and the minimization of communication time may require the