Add to ORKGSubmitted to 13th IFAC Symposium on Information Control Problems in ManufacturingThis paper is about scheduling parallel jobs, i.e. which can be executed on more than one processor at the same time. Malleable jobs is a special class of parallel jobs. The number of processors a malleable job is executed on may change during the execution. In this work, we consider the NP-hard problem of scheduling malleable jobs to minimize the total weighted completion time or mean weighted flow time. For this problem, we introduce an important dominance rule which can be used to reduce the search space while searching for an optimal solution.ALgorithmique des Plates-formes A Grande Echell
We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize sch...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to mini...
In this paper we propose an approximation algorithm for scheduling malleable tasks with precedence c...
This paper is about scheduling parallel jobs, i.e. which can be executed on more than one machine at...
Submitted to 13th IFAC Symposium on Information Control Problems in ManufacturingInternational audie...
International audienceThis paper deals with the problem of scheduling nA malleable and nB non-mallea...
A malleable task is a computational unit which may be executed on any arbitrary number of processors...
In this paper we study scheduling malleable tasks with limited par-allelism, for mean ow time criter...
A malleable parallel job is one that may be assigned to any number of processors in a parallel compu...
International audienceIn this paper, we consider an identical parallel machine scheduling problem wi...
We consider in this paper the problem of scheduling a set of inde- pendent parallel tasks (jobs) wit...
This work presents approximation algorithms for scheduling the tasks of a parallel application that ...
A malleable parallel task is one whose execution time is a function of the number of (identical) pro...
The problem of scheduling n tasks in a multiprocessor system with m processors to minimize the makes...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to min...
We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize sch...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to mini...
In this paper we propose an approximation algorithm for scheduling malleable tasks with precedence c...
This paper is about scheduling parallel jobs, i.e. which can be executed on more than one machine at...
Submitted to 13th IFAC Symposium on Information Control Problems in ManufacturingInternational audie...
International audienceThis paper deals with the problem of scheduling nA malleable and nB non-mallea...
A malleable task is a computational unit which may be executed on any arbitrary number of processors...
In this paper we study scheduling malleable tasks with limited par-allelism, for mean ow time criter...
A malleable parallel job is one that may be assigned to any number of processors in a parallel compu...
International audienceIn this paper, we consider an identical parallel machine scheduling problem wi...
We consider in this paper the problem of scheduling a set of inde- pendent parallel tasks (jobs) wit...
This work presents approximation algorithms for scheduling the tasks of a parallel application that ...
A malleable parallel task is one whose execution time is a function of the number of (identical) pro...
The problem of scheduling n tasks in a multiprocessor system with m processors to minimize the makes...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to min...
We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize sch...
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to mini...
In this paper we propose an approximation algorithm for scheduling malleable tasks with precedence c...