Pages that link to "Item:Q1293204"
From MaRDI portal
The following pages link to Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (Q1293204):
Displaying 10 items.
- Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan (Q744652) (← links)
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation (Q954934) (← links)
- Resource level minimization in the discrete-continuous scheduling (Q1043331) (← links)
- Discrete-continuous scheduling problems -- mean completion time results (Q1278310) (← links)
- On a methodology for discrete-continuous scheduling (Q1296092) (← links)
- Approximation algorithms for some discrete-continuous scheduling problems (Q1332457) (← links)
- Minimization of mean flow time for some discrete-continuous scheduling problems (Q1368686) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic (Q2255054) (← links)
- On a certain class of power- and energy-related scheduling problems (Q2422748) (← links)