Optimising makespan and energy consumption in task scheduling for parallel systems

DOI10.1016/J.COR.2023.106212MaRDI QIDQ6164588zbMATH OpenFDO

Authors Russell Stewart, Andrea Raith, Oliver Sinnen

Publication date 4 July 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2023.106212

zbMATH Keywords

bi-objectivemixed-integer linear programparallel processingPareto-efficient solutionstask scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Makespan minimization for parallel jobs with energy constraint
• Particle swarm optimization based sequential and parallel tasks scheduling model for heterogeneous multiprocessor systems
• Minimizing makespan for parallelizable jobs with energy constraint
• Power and performance management for parallel computations in clouds and data centers
• Scheduling malleable tasks on parallel processors to minimize the makespan

Cites work

• A bi-objective heuristic approach for green identical parallel machine scheduling
• Adaptive Scalarization Methods in Multiobjective Optimization
• An exact algorithm for biobjective integer programming problems
• ASSESSING THE PERFORMANCE OF ENERGY-AWARE MAPPINGS
• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• Bicriteria Transportation Problem
• Branch-and-bound for bi-objective integer programming
• Constructing robust crew schedules with bicriteria optimization
• Finding representative systems for discrete bicriterion optimization problems
• Flow shop scheduling with peak power consumption constraints
• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
• Multicriteria Optimization
• Reducing the solution space of optimal task scheduling
• Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
• Scheduling for parallel processing
• Speed scaling of tasks with precedence constraints
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
• UET scheduling with unit interprocessor communication delays

Cited in

(7)

• Energy efficient scheduling of parallelizable jobs
• Makespan minimization for parallel jobs with energy constraint
• Energy-efficient multiprocessor scheduling for flow time and makespan
• Energy Efficient Scheduling of Parallelizable Jobs
• Analysis of power in preprocessing methodologies for datasets with missing values
• Scheduling jobs to minimize a convex function of resource usage
• Approximation algorithms for open shop variations subject to energy consumption

This page was built for publication: Optimising makespan and energy consumption in task scheduling for parallel systems

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