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.
|ISSN van geprinte versie||0926-4493|