Job Scheduling Problem using Improved Cuckoo search Algorithm

Abstract

Soft computing based several techniques had already been applied previously in various industrial applications. This paper tries to provide application of various algorithms on job scheduling problem. The expected future needs of industry are based on proper application of these algorithms. In single objective optimization point is to discover a schedule that limits general culmination time known as makespan.

The Paper represents comparative study of algorithms shows calculation of reduced makespan. Modified computation allocates jobs precisely than GA.Thus after applying it is found that performance of hybrid Genetic-cuckoo search Algorithm approach is effective in finding ideal solutions contrasted with that of different methodologies.