Optimizing busy time on parallel machines

DOI10.1016/J.TCS.2014.10.033MaRDI QIDQ476900zbMATH OpenOpenAlexFDO

Authors George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks

Publication date 2 December 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.10.033

zbMATH Keywords

approximation algorithmsresource allocationinterval schedulingbusy time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Online optimization of busy time on parallel machines
• Online optimization of busy time on parallel machines. (Extended abstract)
• scientific article; zbMATH DE number 5079305
• Maximizing the minimum completion time on parallel machines
• Parallel machine scheduling with time dependent processing times
• Parallel-machine scheduling with time dependent processing times
• Optimal batch schedules for parallel machines
• scientific article; zbMATH DE number 1559527
• Approximating total flow time on parallel machines
• Parallel machine scheduling with speed-up resources

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• scientific article; zbMATH DE number 2038752 (Why is no real title available?)
• scientific article; zbMATH DE number 2079419 (Why is no real title available?)
• scientific article; zbMATH DE number 2086936 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• scientific article; zbMATH DE number 1445390 (Why is no real title available?)
• A unified approach to approximating resource allocation and scheduling
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Interval scheduling: A survey
• Minimizing busy time in multiple machine real-time scheduling
• Minimizing total busy time in parallel scheduling with application to optical networks
• Scheduling algorithms
• Sleep management on multiple machines for energy and flow time
• The regenerator location problem

Cited in

(10)

• Active and busy time scheduling problem: a survey
• Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
• Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints
• Real-time scheduling to minimize machine busy times
• LP rounding and combinatorial algorithms for minimizing active and busy time
• Minimizing total busy time in parallel scheduling with application to optical networks
• Online optimization of busy time on parallel machines. (Extended abstract)
• Complexity and online algorithms for minimum skyline coloring of intervals
• Minimizing busy time in multiple machine real-time scheduling
• Online optimization of busy time on parallel machines

This page was built for publication: Optimizing busy time on parallel machines

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