Preemptive scheduling of equal-length jobs to maximize weighted throughput

Preemptive scheduling of equal-length jobs to maximize weighted throughput

0.00 Avg rating0 Votes
Article ID: iaor20043292
Country: Netherlands
Volume: 32
Issue: 3
Start Page Number: 258
End Page Number: 264
Publication Date: May 2004
Journal: Operations Research Letters
Authors: , , , ,
Keywords: scheduling
Abstract:

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. In Graham's notation this problem is described as (1|r;pj=p;pmtn|∑wjUj). We provide an O(n4)-time algorithm, improving the previous bound of O(n10).

Reviews

Required fields are marked *. Your email address will not be published.