Complexity of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2018

Complexity of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time

Résumé

This paper deals with a particular scheduling problem. We consider unit-time jobs and in-tree precedence constraints while minimizing the mean flow time. This problem is observed as P |p j = 1, in-tree| C j with the use of the 3-filed notation. To the best of our knowledge, its complexity is still open. Through a reduction from 3-Partition, we show that this problem is N P-complete.
Fichier principal
Vignette du fichier
Manuscript.pdf (318.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01800804 , version 1 (28-05-2018)

Identifiants

  • HAL Id : hal-01800804 , version 1

Citer

Tiayu Wang, Odile Bellenguez-Morineau. Complexity of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time. 2018. ⟨hal-01800804⟩
65 Consultations
45 Téléchargements

Partager

Gmail Facebook X LinkedIn More