Pages that link to "Item:Q2908847"
From MaRDI portal
The following pages link to Minimizing Busy Time in Multiple Machine Real-time Scheduling (Q2908847):
Displayed 12 items.
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Race to idle or not: balancing the memory sleep time with DVS for energy minimization (Q1743492) (← links)
- Minimum hitting set of interval bundles problem: computational complexity and approximability (Q2161003) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity (Q2988826) (← links)
- Active and Busy Time Scheduling Problem: A Survey (Q3297831) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5919565) (← links)