The Complexity of Mean Flow Time Scheduling Problems with Release Times

Abstract : We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that when all jobs have equal processing times then the problem can be solved in polynomial time using linear programming. Our algorithm can also be applied to the open-shop problem with release times and unit processing times. For the general case (when processing times are arbitrary), we show that the problem is unary NP-hard.
Type de document :
Article dans une revue
Journal of Scheduling, Springer Verlag, 2007, 10 (2), pp.139-146. 〈10.1007/s10951-006-0006-4〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00123665
Contributeur : Christoph Dürr <>
Soumis le : mercredi 10 janvier 2007 - 16:01:26
Dernière modification le : vendredi 7 décembre 2018 - 01:25:07

Lien texte intégral

Identifiants

Citation

Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana Kravchenko, et al.. The Complexity of Mean Flow Time Scheduling Problems with Release Times. Journal of Scheduling, Springer Verlag, 2007, 10 (2), pp.139-146. 〈10.1007/s10951-006-0006-4〉. 〈inria-00123665〉

Partager

Métriques

Consultations de la notice

249