Greedy minimum-energy scheduling

DOI10.1007/978-3-031-49815-2_5MaRDI QIDQ6574928FDOQ6574928

Authors: Gunther Bidlingmaier 

Publication date: 19 July 2024

zbMATH Keywords

approximation algorithmsschedulinggreedy algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• Polynomial Time Algorithms for Minimum Energy Scheduling
• Scheduling unit tasks to minimize the number of idle periods
• Scheduling to minimize gaps and power consumption
• Parallel Machine Scheduling to Minimize Energy Consumption
• Title not available (Why is that?)

This page was built for publication: Greedy minimum-energy scheduling

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