A hybrid job scheduling algorithm based on Tabu and Harmony search algorithms

Nowadays, cloud computing became a very important way of processing very large and complicated jobs and services. To serve millions of users with a high satisfaction regarding cost and time requires a powerful way to schedule cloud users' jobs. Job scheduling in a cloud computing environment is an NP-hard problem. Many scheduling algorithms have been proposed by researchers to solve such a complicated problem. In this research, a hybrid Tabu-Harmony task scheduling algorithm in cloud computing is proposed, and the proposed algorithm combines the benefits of both the Tabu search and the Harmony search algorithms in order to enhance the quality of the results. The proposed algorithm is evaluated in terms of throughput, makespan and total cost and achieved a better result compared to Tabu search, Harmony search and round-robin in terms of makespan and cost.