Green scheduling, flows and matchings

DOI10.1016/J.TCS.2015.02.020MaRDI QIDQ2344761zbMATH OpenOpenAlexFDO

Authors Evripidis Bampis, Dimitrios Letsios, G. Lucarelli

Publication date 18 May 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.02.020

zbMATH Keywords

convex cost flowspolynomial-time algorithmsspeed-scalingweighted matchings

Mathematics Subject Classification ID

Flows in graphs (05C21) 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) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• Green scheduling, flows and matchings
• Speed scaling on parallel processors with migration
• Power-aware scheduling for makespan and flow
• Speed scaling on parallel processors with migration
• Energy-efficient algorithms for non-preemptive speed-scaling

Cites work

• Algorithm Theory - SWAT 2004
• Algorithms for dynamic speed scaling
• Energy-efficient algorithms for flow time minimization
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• Minimizing the sum of weighted completion times in a concurrent open shop
• Network flows. Theory, algorithms, and applications.
• On Simplex Pivoting Rules and Complexity Theory
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling independent tasks to reduce mean finishing time
• Scheduling with deadlines and loss functions
• Speed scaling on parallel processors with migration
• Speed scaling with an arbitrary power function

Cited in

(13)

• Energy-efficient scheduling and routing via randomized rounding
• Scheduling on power-heterogeneous processors
• Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
• A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
• Approximation algorithms for energy-efficient scheduling of parallel jobs
• Models and algorithms for energy-efficient scheduling with immediate start of jobs
• A Review for Submodular Optimization on Machine Scheduling Problems
• The optimum green split of a cycle time
• Green scheduling, flows and matchings
• Machine speed scaling by adapting methods for convex optimization with submodular constraints
• Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
• The seeds of the NEH algorithm: an overview using bibliometric analysis
• An adaptive genetic algorithm with optimal recombination for scheduling problems with energy resource

This page was built for publication: Green scheduling, flows and matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344761)