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

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

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

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

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

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