On Unrelated Machine Scheduling with Precedence Constraints

Abstract : In this paper, we consider the problem of scheduling tasks on unrelated parallel machines. Precedence constraints exist between the tasks, but their number is limited compared with the number of tasks. We propose a number of heuristics in order to find near-optimal solutions to the problem. Empirical results show that the heuristics are able to find very good approximate solutions.
Type de document :
Rapport
[Research Report] RR-2773, INRIA. 1996, pp.22
Liste complète des métadonnées

https://hal.inria.fr/inria-00073919
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:05:23
Dernière modification le : samedi 17 septembre 2016 - 01:06:49
Document(s) archivé(s) le : jeudi 24 mars 2011 - 13:21:13

Fichiers

Identifiants

  • HAL Id : inria-00073919, version 1

Collections

Citation

Jeffrey Herrmann, Jean-Marie Proth, Nathalie Sauer. On Unrelated Machine Scheduling with Precedence Constraints. [Research Report] RR-2773, INRIA. 1996, pp.22. 〈inria-00073919〉

Partager

Métriques

Consultations de la notice

156

Téléchargements de fichiers

89