The Complexity of Mean Flow Time Scheduling Problems with Release Times

Simple item page
dc.creatorBaptiste, Philippe
dc.creatorBrucker, Peter
dc.creatorChrobak, Marek
dc.creatorDurr, Christoph
dc.creatorKravchenko, Svetlana A.
dc.creatorSourd, Francis
dc.date2006-05-17
dc.date.accessioned2026-07-07T07:09:32Z
dc.date.available2026-07-07T07:09:32Z
dc.descriptionWe 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.
dc.descriptionSubsumes and replaces cs.DS/0412094 and "Complexity of mean flow time scheduling problems with release dates" by P.B, S.K
dc.identifierhttps://arxiv.org/abs/cs/0605078
dc.identifierhttp://arxiv.org/abs/cs/0605078
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111101
dc.subjectData Structures and Algorithms
dc.subjectF.2.2
dc.titleThe Complexity of Mean Flow Time Scheduling Problems with Release Times
dc.typetext

Files

Collections

arXiv