• Publications
  • Influence
Approximation schemes for minimizing average weighted completion time with release dates
TLDR
In this paper, we present the first PTASs for scheduling to minimize average weighted completion time in the presence of release dates in various machine models. Expand
Energy-Efficient Algorithms for Non-preemptive Speed-Scaling
TLDR
We improve complexity bounds for energy-efficient non-preemptive scheduling problems for both the single processor and multi-processor cases. Expand
Scheduling in Switching Networks with Set-Up Delays
TLDR
This work has been partially supported by the the European Union (FET-Working Group APPOL II), and the Greek General Secretariat of Research and Technology. Expand
Speed scaling with power down scheduling for agreeable deadlines
TLDR
This work is supported by the ANR grants NETOC and TODO as well as by the GdR recherche opérationnelle. Expand
Energy Efficient Scheduling of MapReduce Jobs
TLDR
In this work, we study power-aware MapReduce scheduling in the speed scaling setting first introduced by Yao et al. Expand
On Multiprocessor Temperature-Aware Scheduling Problems
TLDR
We study temperature-aware scheduling problems under the model introduced by Chrobak et al. in [9], where unit-length jobs of given heat contributions are to be scheduled on a set of parallel identical processors. Expand
Scheduling UET-UCT Series-Parallel Graphs on Two Processors
TLDR
The scheduling of task graphs on two identical processors is considered. Expand
Speed Scaling for Maximum Lateness
TLDR
We consider the power-aware problem of scheduling non-preemptively a set of jobs on a single speed-scalable processor so as to minimize the maximum lateness, under a given budget of energy. Expand
On the Maximum Edge Coloring Problem
TLDR
We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one of weight equal to the maximum weight ofits edges, so that the total weight of the partition is minimized. Expand
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors
TLDR
We propose a constant approximation algorithm for generalizations of the Flexible Flow Shop FFS problem which form a realistic model for non-preemptive scheduling in MapReduce systems. Expand
...
1
2
3
4
5
...