3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2004★ 3 cited
A Note on Scheduling Equal-Length Jobs to Maximize Throughput
Marek Chrobak, Christoph Durr, Wojciech Jawor +2
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.…
cs.DS2002
Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput
Philippe Baptiste, Marek Chrobak, Christoph Durr +2
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…