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.
Original language | English |
---|---|
Pages (from-to) | 259-272 |
Journal | Discrete applied mathematics |
Volume | 55 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1995 |
Keywords
- Multiprocessor tasks
- Prespecified processor allocations
- Makespan
- Total completion time
- Release dates
- Precedence constraints