Add to ORKGWe 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
In this paper, we consider the problem of scheduling tasks on two dedicated processors where some ta...
Abstract — Many parallel applications from scientic computing show a modular structure and are there...
This paper adresses certain types of scheduling problems that arise when a parallel computation is t...
textabstractWe investigate the computational complexity of scheduling multiprocessor tasks with pres...
We investigate the computational complexity of scheduling multiprocessor tasks with prespecified pro...
AbstractWe investigate the computational complexity of scheduling multiprocessor tasks with prespeci...
The paper is concerned with scheduling problems with multiprocessor tasks and presents conditions un...
AbstractThe paper is concerned with scheduling problems with multiprocessor tasks and presents condi...
This paper addresses certain types of scheduling problems that arise when a parallel computation is ...
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Mul...
AbstractWe investigate the problem of minimizing the makespan (resp. the sum of completion time) for...
. In traditional precedence-constrained scheduling a task is ready to execute when all its predecess...
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Mul...
In this work we consider the problem of scheduling multiprocessor tasks on parallel processors avail...
Abstract — Many parallel applications from scientic computing show a modular structure and are there...
In this paper, we consider the problem of scheduling tasks on two dedicated processors where some ta...
Abstract — Many parallel applications from scientic computing show a modular structure and are there...
This paper adresses certain types of scheduling problems that arise when a parallel computation is t...
textabstractWe investigate the computational complexity of scheduling multiprocessor tasks with pres...
We investigate the computational complexity of scheduling multiprocessor tasks with prespecified pro...
AbstractWe investigate the computational complexity of scheduling multiprocessor tasks with prespeci...
The paper is concerned with scheduling problems with multiprocessor tasks and presents conditions un...
AbstractThe paper is concerned with scheduling problems with multiprocessor tasks and presents condi...
This paper addresses certain types of scheduling problems that arise when a parallel computation is ...
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Mul...
AbstractWe investigate the problem of minimizing the makespan (resp. the sum of completion time) for...
. In traditional precedence-constrained scheduling a task is ready to execute when all its predecess...
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Mul...
In this work we consider the problem of scheduling multiprocessor tasks on parallel processors avail...
Abstract — Many parallel applications from scientic computing show a modular structure and are there...
In this paper, we consider the problem of scheduling tasks on two dedicated processors where some ta...
Abstract — Many parallel applications from scientic computing show a modular structure and are there...
This paper adresses certain types of scheduling problems that arise when a parallel computation is t...