On scheduling malleable jobs to minimise the total weighted completion time
SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
< Reduce
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Language
en
Communication dans un congrès
This item was published in
13th IFAC Symposium on Information Control Problems in Manufacturing, 2009-06-03, Moscow. 2009
English Abstract
This 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 ...Read more >
This 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.Read less <
English Keywords
Combinatorial Mathematics
Scheduling
Total Completion Time
Parallel Jobs
Malleable Jobs
ANR Project
ALgorithmique des Plates-formes A Grande Echelle - ANR-05-MMSA-0006
Origin
Hal imported