The following pages link to Non-preemptive speed scaling (Q398859):
Displaying 11 items.
- Scheduling on a single machine under time-of-use electricity tariffs (Q271939) (← links)
- Throughput maximization in multiprocessor speed-scaling (Q278716) (← links)
- A survey of offline algorithms for energy minimization under deadline constraints (Q283261) (← links)
- Scheduling on power-heterogeneous processors (Q1680505) (← links)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← links)
- Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
- Approximation algorithms for energy-efficient scheduling of parallel jobs (Q2215201) (← links)
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems (Q2633602) (← links)
- Throughput Maximization in Multiprocessor Speed-Scaling (Q2942633) (← links)
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling (Q3453287) (← links)