3 citations · 6 across the 5 of their papers we have counts for
5 papers
Polynomial Time Algorithms for Minimum Energy Scheduling
Philippe Baptiste, Marek Chrobak, Christoph Durr
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for savin…
Fast paths in large-scale dynamic road networks
Giacomo Nannicini, Philippe Baptiste, Gilles Barbier +2
Efficiently computing fast paths in large scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by severa…
The Complexity of Mean Flow Time Scheduling Problems with Release Times
Philippe Baptiste, Peter Brucker, Marek Chrobak +3
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that whe…
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.…
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…