Optimizing busy time on parallel machines
DOI10.1016/J.TCS.2014.10.033zbMATH Open1303.90050OpenAlexW2032570272MaRDI QIDQ476900FDOQ476900
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
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
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)
Cites Work
- Title not available (Why is that?)
- The regenerator location problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling algorithms
- Interval scheduling: A survey
- A unified approach to approximating resource allocation and scheduling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Title not available (Why is that?)
- Minimizing busy time in multiple machine real-time scheduling
- Sleep management on multiple machines for energy and flow time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing total busy time in parallel scheduling with application to optical networks
Cited In (11)
- Minimizing busy time in multiple machine real-time scheduling
- Real-time scheduling to minimize machine busy times
- Scheduling maintenance jobs in networks
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
- Complexity and online algorithms for minimum skyline coloring of intervals
- Online optimization of busy time on parallel machines
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints
- Minimizing total busy time in parallel scheduling with application to optical networks
- LP rounding and combinatorial algorithms for minimizing active and busy time
- Online optimization of busy time on parallel machines. (Extended abstract)
- Active and busy time scheduling problem: a survey
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)
