Active and Busy Time Scheduling Problem: A Survey

DOI10.1007/978-3-030-41672-0_13zbMath1440.68030OpenAlexW3008305525MaRDI QIDQ3297831

Minming Li, Vincent Chau

Publication date: 20 July 2020

Published in: Complexity and Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-41672-0_13

zbMATH Keywords

approximationbusy timeactive time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Cites Work

• A survey of offline algorithms for energy minimization under deadline constraints
• Optimizing busy time on parallel machines
• Online optimization of busy time on parallel machines
• A model for minimizing active processor time
• Minimizing total busy time in parallel scheduling with application to optical networks
• LP rounding and combinatorial algorithms for minimizing active and busy time
• Busy time scheduling on a bounded number of machines (extended abstract)
• Optimal Batch Schedules for Parallel Machines
• Minimizing Busy Time in Multiple Machine Real-time Scheduling
• Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity
• The regenerator location problem
• Scheduling unit tasks to minimize the number of idle periods
• Algorithms - ESA 2003
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Active and Busy Time Scheduling Problem: A Survey