LP rounding and combinatorial algorithms for minimizing active and busy time

DOI10.1007/s10951-017-0531-3zbMath1386.90048arXiv1610.08154OpenAlexW2624258401MaRDI QIDQ1702663

Koyel Mukherjee, Samir Khuller, Jessica Chang

Publication date: 28 February 2018

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

Full work available at URL: https://arxiv.org/abs/1610.08154

zbMATH Keywords

batch schedulingbusy timeactive time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Scheduling maintenance jobs in networks ⋮ Minimum hitting set of interval bundles problem: computational complexity and approximability ⋮ Real-time scheduling to minimize machine busy times ⋮ Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity ⋮ Active and Busy Time Scheduling Problem: A Survey ⋮ A new LP rounding algorithm for the active time problem

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating the traffic grooming problem in tree and star networks
• Optimizing busy time on parallel machines
• A model for minimizing active processor time
• Optimizing regenerator cost in traffic grooming
• Minimizing total busy time in parallel scheduling with application to optical networks
• Randomized online algorithms for maximizing busy time interval scheduling
• Optimal Batch Schedules for Parallel Machines
• Online Optimization of Busy Time on Parallel Machines
• Minimizing Busy Time in Multiple Machine Real-time Scheduling
• Algorithms - ESA 2003
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Algorithms and Computation

This page was built for publication: LP rounding and combinatorial algorithms for minimizing active and busy time