Minimizing the makespan using Hybrid algorithm for cloud computing

Cloud computing technologies offer major benefits to the IT industries in terms of elasticity and rapid provisioning, pay-as-you-go-model, reduced capital cost, access to unlimited resources, flexibility. Job scheduling is a combinatorial optimization problem in the fields of computer science where the ideal jobs are assigned to required resource at a particular instant of time. In this paper we proposed Hybrid algorithm which combine the advantage of ACO and Cuckoo search. The makespan or completion time can be reduced with the help of hybrid algorithm, since the jobs have been executed with in the specified time interval by allocation of required resources using the Hybrid algorithm. The obtain results shows that Hybrid algorithm performs well than compared with the ACO algorithm in terms of performance of the algorithm and makespan.