A Note on Scheduling Equal-Length Jobs to Maximize Throughput

Details A Note on Scheduling Equal-Length Jobs to Maximize Throughput A Note on Scheduling Equal-Length Jobs to Maximize Throughput

2004-10-18

arxiv.org/abs/cs/0410046v1

Computer Science

Data Structures and Algorithms

Scientific paper

We study the problem of scheduling equal-length jobs with release times and deadlines, where the objective is to maximize the number of completed jobs. Preemptions are not allowed. In Graham's notation, the problem is described as 1|r_j;p_j=p|\sum U_j. We give the following results: (1) We show that the often cited algorithm by Carlier from 1981 is not correct. (2) We give an algorithm for this problem with running time O(n^5).

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512632