SADYKOV, Ruslan

Métadonnées

Licence d’utilisation du document

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]

Langue

Communication dans un congrès

Ce document a été publié dans

13th IFAC Symposium on Information Control Problems in Manufacturing, 2009-06-03, Moscow. 2009

Résumé en anglais

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.< Réduire

Mots clés en anglais

Combinatorial Mathematics

Scheduling

Total Completion Time

Parallel Jobs

Malleable Jobs

URI

https://oskar-bordeaux.fr/handle/20.500.12278/191421

Project ANR

ALgorithmique des Plates-formes A Grande Echelle - ANR-05-MMSA-0006

Origine

Importé de hal

Unités de recherche

Institut de Mathématiques de Bordeaux (IMB) - UMR 5251