@book{fe19f293214b496cb69c50ab690a0931,
title = "Complexity of scheduling multiprocessors 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. Key words & Phrases: Multiprocessor tasks, prespecified processor allocations, makespan, total completion time, release dates, precedence constraints.",
author = "J.A. Hoogeveen and {Velde, van de}, S.L. and B. Veltman",
year = "1992",
language = "English",
series = "Memorandum COSOR",
publisher = "Technische Universiteit Eindhoven",
}