An Efficient Biobjective Heuristic for Scheduling Workflows on Heterogeneous DVS-Enabled Processors.
Pengji ZhouWei ZhengPublished in: J. Appl. Math. (2014)
Keyphrases
- list scheduling
- bi objective
- set covering problem
- scheduling algorithm
- scheduling problem
- multiple objectives
- efficient solutions
- pareto local search
- multi objective
- minimum cost flow
- parallel machines
- set covering
- network design
- ant colony optimization
- precedence constraints
- optimal solution
- energy consumption
- shortest path algorithm
- wireless sensor networks
- response time
- shortest path problem
- column generation
- tabu search
- multi objective optimization
- integer programming
- job shop scheduling problem
- knapsack problem
- combinatorial optimization
- search algorithm
- resource allocation