Green Scheduling, Flows and Matchings
From MaRDI portal
Publication:4909527
DOI10.1007/978-3-642-35261-4_14zbMath1260.90086OpenAlexW2176257353MaRDI QIDQ4909527
Giorgio Lucarelli, Dimitrios Letsios, Evripidis Bampis
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_14
Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (7)
Throughput maximization in multiprocessor speed-scaling ⋮ A survey of offline algorithms for energy minimization under deadline constraints ⋮ Sustainable operations ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Speed scaling on parallel processors with migration ⋮ From preemptive to non-preemptive speed-scaling scheduling ⋮ From Preemptive to Non-preemptive Speed-Scaling Scheduling
This page was built for publication: Green Scheduling, Flows and Matchings
