Resource cost aware scheduling
From MaRDI portal
Abstract: 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.
Recommendations
- Optimal algorithms and a PTAS for cost-aware scheduling
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
- Resource scheduling with supply constraint and linear cost
- Single machine scheduling with resource dependent release times and processing times
- Approximation algorithms for scheduling with resource and precedence constraints
Cites work
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
- A bicriterion approach to time/cost trade-offs in sequencing
- A multi-objective approach to resource allocation in single machine scheduling
- A survey of scheduling with controllable processing times
- Algorithms and Data Structures
- Algorithms for power savings
- Approximation techniques for average completion time scheduling
- Average Rate Speed Scaling
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Energy-efficient algorithms for flow time minimization
- Getting the best response for your erg
- scientific article; zbMATH DE number 4035555 (Why is no real title available?)
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 871909 (Why is no real title available?)
- scientific article; zbMATH DE number 6472636 (Why is no real title available?)
- List Scheduling in Order of α-Points on a Single Machine
- Minimizing average completion time in the presence of release dates
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Project scheduling under uncertainty: survey and research potentials
- Scheduling
- Scheduling for Speed Bounded Processors
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Single machine batch scheduling with resource dependent setup and processing times
- Single machine scheduling problem with a common deadline and resource dependent release dates
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single machine scheduling with release dates
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
- Speed scaling for weighted flow time
- Speed scaling of tasks with precedence constraints
- Speed scaling to manage energy and temperature
- Speed scaling to manage temperature
- Speed scaling with an arbitrary power function
- STACS 2005
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
Cited in
(7)- Greed in resource scheduling
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
- Acquisition planning and scheduling of computing resources
- scientific article; zbMATH DE number 2038779 (Why is no real title available?)
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
This page was built for publication: Resource cost aware scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1750475)
