A new LP rounding algorithm for the active time problem

DOI10.1007/S10951-020-00676-1MaRDI QIDQ2066698zbMATH OpenOpenAlexFDO

Authors 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

active timeapproximation algorithmlinear program roundingscheduling

Mathematics Subject Classification ID

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

Recommendations

• LP rounding and combinatorial algorithms for minimizing active and busy time
• scientific article; zbMATH DE number 871909
• Busy time scheduling on a bounded number of machines (extended abstract)

Cites work

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

Cited in

(3)

• LP rounding and combinatorial algorithms for minimizing active and busy time
• Scheduling tasks to minimize active time on a processor with unlimited capacity
• Online flexible busy time scheduling on heterogeneous machines

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

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