A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Scheduling Année : 2015

A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines

Résumé

In the paper “The complexity of mean flow time scheduling problems with release times”, by Baptiste, Brucker, Chrobak, Dürr, Kravchenko and Sourd, the authors claimed to prove strong NP -hardness of the scheduling problem P|pmtn,rj|∑Cj , namely multiprocessor preemptive scheduling where the objective is to minimize the mean flow time. We point out a serious error in their proof and give a new proof of strong NP -hardness for this problem.
Fichier non déposé

Dates et versions

hal-01154423 , version 1 (21-05-2015)

Identifiants

Citer

Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot. A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines. Journal of Scheduling, 2015, 18 (3), pp.299-304. ⟨10.1007/s10951-014-0380-2⟩. ⟨hal-01154423⟩
174 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More