Complexity of scheduling multiprocessor tasks with prespecified processor allocations

Share/Save/Bookmark

Hoogeveen, J.A. and Velde van de, S.L. and Veltman, B. (1994) Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete applied mathematics, 55 (3). pp. 259-272. ISSN 0166-218X

[img]
Preview
PDF
919Kb
Abstract:We investigate the computational complexity of scheduling multiprocessor tasks with prespecified processor allocations. We consider two criteria: minimizing schedule length and minimizing the sum of the task completion times. In addition, we investigate the complexity of problems when precedence constraints or release dates are involved.
Item Type:Article
Copyright:© 1994 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/32282
Official URL:http://dx.doi.org/10.1016/0166-218X(94)90012-4
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 144535