AbstractWe 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
AbstractWe study a multiprocessor task scheduling problem, in which each task requires a set of μ pr...
We study a multiprocessor task scheduling problem, in which each task requires a set of P processors...
We study a multiprocessor task scheduling problem, in which each task requires a set of P processors...
We investigate the computational complexity of scheduling multiprocessor tasks with prespecified pro...
textabstractWe investigate the computational complexity of scheduling multiprocessor tasks with pres...
We investigate the computational complexity of scheduling multiprocessor tasks with prespecified pro...
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...
AbstractWe investigate the problem of minimizing the makespan (resp. the sum of completion time) for...
AbstractWe investigate the problem of minimizing the makespan (resp. the sum of completion time) for...
University of Technology, Sydney. Dept. of Mathematical Sciences.NO FULL TEXT AVAILABLE. Access is r...
AbstractIn this paper we study task scheduling problems on m identical parallel processors, where ea...
AbstractWe consider the problem of scheduling a set of tasks related by precedence constraints to a ...
International audienceIn this paper we study global fixed-priority scheduling of periodic task syste...
AbstractIn the classical scheduling theory it is widely assumed that any task requires for its proce...
AbstractWe study a multiprocessor task scheduling problem, in which each task requires a set of μ pr...
We study a multiprocessor task scheduling problem, in which each task requires a set of P processors...
We study a multiprocessor task scheduling problem, in which each task requires a set of P processors...
We investigate the computational complexity of scheduling multiprocessor tasks with prespecified pro...
textabstractWe investigate the computational complexity of scheduling multiprocessor tasks with pres...
We investigate the computational complexity of scheduling multiprocessor tasks with prespecified pro...
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...
AbstractWe investigate the problem of minimizing the makespan (resp. the sum of completion time) for...
AbstractWe investigate the problem of minimizing the makespan (resp. the sum of completion time) for...
University of Technology, Sydney. Dept. of Mathematical Sciences.NO FULL TEXT AVAILABLE. Access is r...
AbstractIn this paper we study task scheduling problems on m identical parallel processors, where ea...
AbstractWe consider the problem of scheduling a set of tasks related by precedence constraints to a ...
International audienceIn this paper we study global fixed-priority scheduling of periodic task syste...
AbstractIn the classical scheduling theory it is widely assumed that any task requires for its proce...
AbstractWe study a multiprocessor task scheduling problem, in which each task requires a set of μ pr...
We study a multiprocessor task scheduling problem, in which each task requires a set of P processors...
We study a multiprocessor task scheduling problem, in which each task requires a set of P processors...
DOI
Add to ORKG