Hard-deadline Constrained Workflows Scheduling Using Metaheuristic Algorithms

AbstractAn efficient scheduling is the essential part of complex scientific applications processing in computational distributed environments. The computational complexity comes as from environment heterogeneity as from the application structure that usually is represented as a workflow which contains different linked tasks. A lot of well-known techniques were proposed by different scientific groups. The most popular of them are based on greedy list-based heuristics or evolutionary metaheuristics. In this paper we investigate the applicability of previously developed metaheuristic algorithm – coevolutional genetic algorithm (CGA) for scheduling series of workflows with hard deadlines constraints