Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput
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, which is the total weight of completed jobs. In Graham's notation this problem is described as (1 | rj;pj=p;pmtn | sum wj Uj). We provide an O(n4)-time algorithm for this problem, improving the previous bound of O(n10) by Baptiste.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.