A new LP rounding algorithm for the active time problem

DOI10.1007/S10951-020-00676-1zbMath1480.90128OpenAlexW3134543265MaRDI QIDQ2066698

Yanyan Li

Publication date: 14 January 2022

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-020-00676-1

zbMATH Keywords

schedulingapproximation algorithmactive timelinear program rounding

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)

Cites Work

• A model for minimizing active processor time
• LP rounding and combinatorial algorithms for minimizing active and busy time
• Maximal Flow Through a Network
• Energy Optimal Task Scheduling with Normally-off Local Memory and Sleep-aware Shared Memory with Access Conflict

This page was built for publication: A new LP rounding algorithm for the active time problem