Greedy minimum-energy scheduling

DOI10.1007/978-3-031-49815-2_5MaRDI QIDQ6574928zbMATH OpenFDO

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

• scientific article; zbMATH DE number 2079319 (Why is no real title available?)
• scientific article; zbMATH DE number 7788624 (Why is no real title available?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel Machine Scheduling to Minimize Energy Consumption
• Polynomial Time Algorithms for Minimum Energy Scheduling
• Scheduling to minimize gaps and power consumption
• Scheduling unit tasks to minimize the number of idle periods

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)