The Complexity of Mean Flow Time Scheduling Problems with Release Times
Data Structures and Algorithms
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.cs/0605078,
title = {The Complexity of Mean Flow Time Scheduling Problems with Release Times},
author = {Philippe Baptiste and Peter Brucker and Marek Chrobak and Christoph Durr and Svetlana A. Kravchenko and Francis Sourd},
journal= {arXiv preprint arXiv:cs/0605078},
year = {2007}
}
Comments
Subsumes and replaces cs.DS/0412094 and "Complexity of mean flow time scheduling problems with release dates" by P.B, S.K