Makespan minimization for parallel jobs with energy constraint
From MaRDI portal
Publication:2663741
Recommendations
- Optimising makespan and energy consumption in task scheduling for parallel systems
- Scheduling parallel jobs to minimize the makespan
- Approximation algorithms for energy-efficient scheduling of parallel jobs
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
- Minimizing total completion time in multiprocessor job systems with energy constraint
- Minimizing makespan in parallel flowshops
- Energy efficient scheduling of parallelizable jobs
- Energy Efficient Scheduling of Parallelizable Jobs
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
Cited in
(9)- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- Minimizing total completion time in multiprocessor job systems with energy constraint
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Approximation algorithms for energy-efficient scheduling of parallel jobs
- Optimising makespan and energy consumption in task scheduling for parallel systems
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
- Minimizing makespan for parallelizable jobs with energy constraint
- Complexity and heuristic algorithms for speed scaling scheduling of parallel jobs with energy constraint
- Scheduling parallel jobs to minimize the makespan
This page was built for publication: Makespan minimization for parallel jobs with energy constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663741)