Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time

Details Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time

2004-12-20

arxiv.org/abs/cs/0412094v1

Computer Science

Data Structures and Algorithms

Scientific paper

We study the problem of preemptive scheduling of n equal-length jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. Recently, Brucker and Kravchenko proved that the optimal schedule can be computed in polynomial time by solving a linear program with O(n^3) variables and constraints, followed by some substantial post-processing (where n is the number of jobs.) In this note we describe a simple linear program with only O(mn) variables and constraints. Our linear program produces directly the optimal schedule and does not require any post-processing.

Affiliated with

Also associated with

No associations

Rating

Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time 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 Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-576770