Resource cost aware scheduling

DOI10.1016/j.ejor.2018.02.059zbMath1388.90051arXiv1110.0685OpenAlexW1523072039WikidataQ130185468 ScholiaQ130185468MaRDI QIDQ1750475

Garud Iyengar, Rodrigo A. Carrasco, Clifford Stein

Publication date: 22 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

schedulingapproximation algorithmsspeed-scalingresource aware scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting ⋮ A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph

Uses Software

• Gurobi
• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single machine scheduling with total tardiness criterion and convex controllable processing times
• Speed scaling of tasks with precedence constraints
• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• Single machine scheduling problem with a common deadline and resource dependent release dates
• Single machine scheduling subject to deadlines and resource dependent processing times
• Minimizing average completion time in the presence of release dates
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
• Project scheduling under uncertainty: survey and research potentials
• Minimizing the total weighted flow time in a single machine with controllable processing times
• A survey of scheduling with controllable processing times
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• Approximation Techniques for Average Completion Time Scheduling
• Single Machine Scheduling with Release Dates
• Speed Scaling to Manage Temperature
• Scheduling for Speed Bounded Processors
• Speed scaling to manage energy and temperature
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Algorithms for power savings
• Energy-efficient algorithms for flow time minimization
• Getting the best response for your erg
• Algorithms and Data Structures
• List Scheduling in Order of α-Points on a Single Machine
• Average Rate Speed Scaling
• STACS 2005
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Scheduling
• Single machine batch scheduling with resource dependent setup and processing times

This page was built for publication: Resource cost aware scheduling