Power-aware scheduling for makespan and flow
From MaRDI portal
Publication:1041350
DOI10.1007/s10951-009-0123-yzbMath1176.90196arXivcs/0605126MaRDI QIDQ1041350
Publication date: 2 December 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0605126
90B35: Deterministic scheduling theory in operations research
Related Items
Speed scaling for maximum lateness, Convergecast and broadcast by power-aware mobile agents, Speed scaling on parallel processors, Assigning real-time tasks to heterogeneous processors by applying ant colony optimization, Minimizing total completion time in multiprocessor job systems with energy constraint, Models and algorithms for energy-efficient scheduling with immediate start of jobs, Improved multi-processor scheduling for flow time and energy, Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Speed scaling on parallel processors
- Pre-emptive scheduling problems with controllable processing times
- The algebraic degree of geometric optimization problems
- Approximation schemes for scheduling on parallel machines
- A survey of scheduling with controllable processing times
- Single machine scheduling with controllable release and processing parameters
- Parallel machine scheduling with a convex resource consumption function
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
- On Adaptive Transmission for Energy Efficiency in Wireless Data Networks
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Planning and Scheduling in Manufacturing and Services
- Algorithm Theory - SWAT 2004
- Algorithms and Data Structures
- Energy-Efficient Algorithms for Flow Time Minimization
- Approximation and Online Algorithms
