A complexity analysis 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
Article Dans Une Revue Journal of Scheduling Année : 2019

A complexity analysis 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 strongly N P-hard.
Fichier non déposé

Dates et versions

hal-02062178 , version 1 (20-03-2019)

Identifiants

Citer

Tianyu Wang, Odile Bellenguez-Morineau. A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time. Journal of Scheduling, 2019, ⟨10.1007/s10951-019-00602-0⟩. ⟨hal-02062178⟩
36 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More