Journal
JOURNAL OF APPLIED LOGIC
Volume 24, Issue -, Pages 50-61Publisher
ELSEVIER
DOI: 10.1016/j.jal.2016.11.013
Keywords
Workflow scheduling; Dynamic environment; Evolutionary algorithms; LEFT; GA; GAHEFT
Categories
Funding
- Ministry of Education and Science of the Russian Federation [14.587.21.0024, RFMEFI58715X0024]
Ask authors/readers for more resources
The optimal workflow scheduling is one of the most important issues in heterogeneous distributed computational environments. Existing heuristic and evolutionary scheduling algorithms have their advantages and disadvantages. In this work we propose a hybrid algorithm based on heuristic methods and genetic algorithm (GA) that combines best characteristics of both approaches. We propose heuristic algorithm called Linewise Earliest Finish Time (LEFT) as an alternative for HEFT in initial population generation for GA. We also experimentally show efficiency of described hybrid schemas GAHEFT, GALEFT, GACH for traditional workflow scheduling as well as for variable workload in dynamically changing heterogeneous computational environment. (C) 2016 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available