Optimising makespan and energy consumption in task scheduling for parallel systems
From MaRDI portal
Publication:6164588
DOI10.1016/j.cor.2023.106212MaRDI QIDQ6164588
Andrea Raith, Oliver Sinnen, Russell Stewart
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
parallel processingtask schedulingbi-objectivemixed-integer linear programPareto-efficient solutions
Cites Work
- Unnamed Item
- Reducing the solution space of optimal task scheduling
- Flow shop scheduling with peak power consumption constraints
- Speed scaling of tasks with precedence constraints
- Scheduling for parallel processing
- UET scheduling with unit interprocessor communication delays
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A bi-objective heuristic approach for green identical parallel machine scheduling
- Finding representative systems for discrete bicriterion optimization problems
- An exact algorithm for biobjective integer programming problems
- ASSESSING THE PERFORMANCE OF ENERGY-AWARE MAPPINGS
- Adaptive Scalarization Methods in Multiobjective Optimization
- Bicriteria Transportation Problem
- Constructing robust crew schedules with bicriteria optimization
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
- Branch-and-Bound for Bi-objective Integer Programming
- Multicriteria Optimization
This page was built for publication: Optimising makespan and energy consumption in task scheduling for parallel systems
