2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2004★ 2 cited
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
Philippe Baptiste, Marek Chrobak, Christoph Durr +1
We study the problem of preemptive scheduling of n equal-length jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time.…
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…