Greedy minimum-energy scheduling

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

Gunther Bidlingmaier

Publication date: 19 July 2024

zbMATH Keywords

schedulingapproximation algorithmsgreedy algorithms

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling to minimize gaps and power consumption
• Polynomial Time Algorithms for Minimum Energy Scheduling
• Scheduling unit tasks to minimize the number of idle periods
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel Machine Scheduling to Minimize Energy Consumption

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