Resource Minimization Job Scheduling

DOI10.1007/978-3-642-03685-9_6MaRDI QIDQ3638870zbMATH OpenOpenAlexFDO

Authors Julia Chuzhoy, Paolo Codenotti

Publication date 28 October 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03685-9_6

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
• Real-time scheduling to minimize machine busy times
• Machine scheduling with resource dependent processing times
• Resource constrained scheduling on multiple machines
• Scheduling with a minimum number of machines

Cited in

(8)

• Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints
• Online dynamic power management with hard real-time guarantees
• An improved algorithm for online machine minimization
• Scheduling non-preemptible jobs to minimize peak demand
• Scheduling resources for executing a partial set of jobs
• Non-preemptive speed scaling
• Exploring a resolution method based on an evolutionary game-theoretical model for minimizing the machines with limited workload capacity and interval constraints
• The preemptive resource allocation problem

This page was built for publication: Resource Minimization Job Scheduling

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