Computer Science – Discrete Mathematics
Scientific paper
2011-10-04
Computer Science
Discrete Mathematics
17 pages
Scientific paper
The ever increasing adoption of mobile devices with limited energy storage capacity, on the one hand, and more awareness of the environmental impact of massive data centres and server pools, on the other hand, have both led to an increased interest in energy management algorithms. The main contribution of this paper is to present several new constant factor approximation algorithms for energy aware scheduling problems where the objective is to minimize weighted completion time plus the cost of the energy consumed, in the one machine non-preemptive setting, while allowing release dates and deadlines.Unlike previous known algorithms these new algorithms can handle general job-dependent energy cost functions, extending the application of these algorithms to settings outside the typical CPU-energy one. These new settings include problems where in addition, or instead, of energy costs we also have maintenance costs, wear and tear, replacement costs, etc., which in general depend on the speed at which the machine runs but also depend on the types of jobs processed. Our algorithms also extend to approximating weighted tardiness plus energy cost, an inherently more difficult problem that has not been addressed in the literature.
Carrasco Rodrigo A.
Iyengar Garud
Stein Cliff
No associations
LandOfFree
Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-268217