Models and algorithms for energy-efficient scheduling with immediate start of jobs
From MaRDI portal
Publication:2317131
DOI10.1007/s10951-017-0552-yzbMath1420.90024OpenAlexW2772243814WikidataQ59606502 ScholiaQ59606502MaRDI QIDQ2317131
Bernhard Primas, Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich
Publication date: 8 August 2019
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-017-0552-y
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Throughput maximization in multiprocessor speed-scaling
- A survey of offline algorithms for energy minimization under deadline constraints
- Speed scaling on parallel processors
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Just-in-time scheduling with controllable processing times on parallel machines
- Power-aware scheduling for makespan and flow
- A note on the maximum number of on-time jobs on parallel identical machines.
- On the \(k\)-coloring of intervals
- Scheduling for weighted flow time and energy with rejection penalty
- Green scheduling, flows and matchings
- A survey of scheduling with controllable processing times
- Improved multi-processor scheduling for flow time and energy
- A survey on the continuous nonlinear resource allocation problem
- Interval scheduling on identical machines
- On the Complexity of Speed Scaling
- Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
- An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules
- Interval scheduling: A survey
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Algorithms for Energy Management
- Speed Scaling for Weighted Flow Time
- An Optimal Solution for the Channel-Assignment Problem
- Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines
- Speed Scaling on Parallel Processors with Migration
- Throughput Maximization for Speed-Scaling with Agreeable Deadlines
- Energy-efficient algorithms for flow time minimization
- Getting the best response for your erg
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
