Scheduling unit tasks to minimize the number of idle periods
From MaRDI portal
Publication:3581578
DOI10.1145/1109557.1109598zbMath1192.90063OpenAlexW4242715512MaRDI QIDQ3581578
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109598
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Related Items
A greedy approximation algorithm for minimum-gap scheduling ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ Scheduling with Gaps: New Models and Algorithms ⋮ Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines ⋮ Capacitated max-batching with interval graph compatibilities ⋮ An \(O(n^3)\)-time algorithm for the min-gap unit-length job scheduling problem ⋮ Scheduling to minimize gaps and power consumption ⋮ Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity ⋮ Speed scaling on parallel processors ⋮ Active and Busy Time Scheduling Problem: A Survey ⋮ A model for minimizing active processor time ⋮ Applying real-time interface and calculus for dynamic power management in hard real-time systems ⋮ Scheduling many types of calibrations ⋮ Minimizing the cost of batch calibrations ⋮ Minimizing energy on homogeneous processors with shared memory ⋮ Scheduling with gaps: new models and algorithms ⋮ A fully polynomial-time approximation scheme for speed scaling with a sleep state ⋮ Race to idle ⋮ Unnamed Item ⋮ Online dynamic power management with hard real-time guarantees
