Discrete Island-Based Cuckoo Search with Highly Disruptive Polynomial Mutation and Opposition-Based Learning Strategy for Scheduling of Workflow Applications in Cloud Environments

The optimization-based scheduling algorithms used for scheduling workflows in cloud computing environments may easily get trapped in local optima, especially in the beginning of their simulation processes because of some limitations in their exploration methods. Moreover, the performance of some optimization-based scheduling algorithms may severely degrade when dealing with medium- or large-size scheduling problems. The Island-based Cuckoo Search with highly disruptive polynomial mutation ( i CSPM) algorithm is a parallel version of the Cuckoo Search (CS) algorithm. The i CSPM algorithm incorporates the island model into CS and uses an exploration function based on the highly disruptive polynomial mutation. It has been empirically proven that i CSPM performs better than popular optimization algorithms (e.g., CS and island-based Genetic algorithm). This paper presents a variation of i CSPM called Discrete i CSPM with opposition-based learning strategy (D i CSPM) for scheduling workflows in cloud computing environments based on two objectives: computation and data transmission costs. D i CSPM includes two new features compared to i CSPM. First, it uses the opposition-based learning approach (OBL) in the initialization step at the level of islands, where each island in the island model contains the opposite population of another island. Second, the smallest position value method is used in the D i CSPM algorithm to determine the correct values of the decision variables in the candidate solutions. The proposed algorithm was experimentally evaluated and compared to well-known scheduling algorithms [Best Resource Selection, Particle Swarm Optimization (PSO) and Grey Wolf Optimizer] using two types of workflows: balanced and imbalanced workflows. The overall experimental and statistical results indicate that D i CSPM provides solutions for the scheduling problem of workflows in cloud computing environment faster than the other compared algorithms. Moreover, D i CSPM was evaluated and compared to state-of-the-art algorithms, namely PSO, binary PSO and discrete binary cat swarm optimization using scientific workflows of different sizes using WorkflowSim. The obtained results suggest that D i CSPM provides the best makespan compared to the other algorithms.