On scheduling malleable jobs to minimise the total weighted completion time

Ruslan Sadykov 1, 2
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
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 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.
Type de document :
Communication dans un congrès
13th IFAC Symposium on Information Control Problems in Manufacturing, Jun 2009, Moscow, Russia. 2009
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00339646
Contributeur : Ruslan Sadykov <>
Soumis le : mardi 18 novembre 2008 - 14:49:21
Dernière modification le : jeudi 11 janvier 2018 - 06:22:12
Document(s) archivé(s) le : lundi 7 juin 2010 - 21:41:37

Fichier

ascending_incom.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00339646, version 1

Collections

Citation

Ruslan Sadykov. On scheduling malleable jobs to minimise the total weighted completion time. 13th IFAC Symposium on Information Control Problems in Manufacturing, Jun 2009, Moscow, Russia. 2009. 〈inria-00339646〉

Partager

Métriques

Consultations de la notice

356

Téléchargements de fichiers

260