Pages that link to "Item:Q3581578"
From MaRDI portal
The following pages link to Scheduling unit tasks to minimize the number of idle periods (Q3581578):
Displayed 20 items.
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines (Q401128) (← links)
- Speed scaling on parallel processors (Q476431) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Applying real-time interface and calculus for dynamic power management in hard real-time systems (Q535728) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Scheduling many types of calibrations (Q2039673) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- A fully polynomial-time approximation scheme for speed scaling with a sleep state (Q2319643) (← links)
- Online dynamic power management with hard real-time guarantees (Q2354765) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- Scheduling to minimize gaps and power consumption (Q2434309) (← links)
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines (Q2668758) (← links)
- Scheduling with Gaps: New Models and Algorithms (Q2947014) (← 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)
- Race to idle (Q5501963) (← links)
- (Q5743475) (← links)
- Minimizing the cost of batch calibrations (Q5918836) (← links)
- Minimizing energy on homogeneous processors with shared memory (Q5925517) (← links)
- An \(O(n^3)\)-time algorithm for the min-gap unit-length job scheduling problem (Q6168970) (← links)