The Complexity of Mean Flow Time Scheduling Problems with Release Times

Details The Complexity of Mean Flow Time Scheduling Problems with Release Times The Complexity of Mean Flow Time Scheduling Problems with Release Times

2006-05-17

arxiv.org/abs/cs/0605078v1

Computer Science

Data Structures and Algorithms

Subsumes and replaces cs.DS/0412094 and "Complexity of mean flow time scheduling problems with release dates" by P.B, S.K

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Mean Flow Time Scheduling Problems with Release Times does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Mean Flow Time Scheduling Problems with Release Times, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Mean Flow Time Scheduling Problems with Release Times will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678215