Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity

DOI10.1007/978-3-319-55911-7_18zbMath1485.68023OpenAlexW2600391725WikidataQ62041709 ScholiaQ62041709MaRDI QIDQ2988826

Sheung-Hung Poon, Yingchao Zhao, Weiwei Wu, Yungao Li, Minming Li, Ken C. K. Fong

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_18

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items

Minimum hitting set of interval bundles problem: computational complexity and approximability, Active and Busy Time Scheduling Problem: A Survey

Cites Work

• Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
• A model for minimizing active processor time
• Minimizing total busy time in parallel scheduling with application to optical networks
• Efficient scheduling algorithms for a single batch processing machine
• LP rounding and combinatorial algorithms for minimizing active and busy time
• Scheduling to minimize gaps and power consumption
• Optimal Batch Schedules for Parallel Machines
• Online Optimization of Busy Time on Parallel Machines
• Minimizing Busy Time in Multiple Machine Real-time Scheduling
• Polynomial Time Algorithms for Minimum Energy Scheduling
• Scheduling unit tasks to minimize the number of idle periods