@article{c5cfefe487524c55a556ad78bad4176c,
title = "Complexity of scheduling multiprocessor tasks with prespecified processor allocations",
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.",
keywords = "Multiprocessor tasks, Prespecified processor allocations, Makespan, Total completion time, Release dates, Precedence constraints",
author = "J.A. Hoogeveen and {van de Velde}, S.L. and B. Veltman",
year = "1995",
doi = "10.1016/0166-218X(94)90012-4",
language = "English",
volume = "55",
pages = "259--272",
journal = "Discrete applied mathematics",
issn = "0166-218X",
publisher = "Elsevier B.V.",
number = "3",
}