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.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/inria-00123665
Contributor : Christoph Dürr <>
Submitted on : Wednesday, January 10, 2007 - 4:01:26 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM

Links full text

Identifiers

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⟩

Share

Metrics

Record views

270