Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput

Details Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput

2002-09-30

arxiv.org/abs/cs/0209033v2

Computer Science

Data Structures and Algorithms

gained one author and lost one degree in the complexity

Scientific paper

We study the problem of computing a preemptive schedule of equal-length jobs with given release times, deadlines and weights. Our goal is to maximize the weighted throughput, which is the total weight of completed jobs. In Graham's notation this problem is described as (1 | r_j;p_j=p;pmtn | sum w_j U_j). We provide an O(n^4)-time algorithm for this problem, improving the previous bound of O(n^{10}) by Baptiste.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693999