Enhancement of jobshop scheduling problem using search optimization

Jobshop scheduling is a most difficult problem, both theoretically and practically. It is classified as NP-Hard Problem. Nature Inspired (or bio-inspired) Algorithms is a new age in layering spacious series of applications and solution to different optimization problems. These algorithms are known as clever algorithms. Job shop scheduling is a problem of constrained optimization and it is most universal and complex problem among all shop scheduling problems Nature inspired algorithms and approximation algorithms seem to be very effective in giving near optimal solutions to such complex problems. In this paper, the concept of the cuckoo search (CS) algorithm (metaheuristic approach to solve structural optimization problems) is elaborated and estimate the approach that cuckoo search optimization algorithm can perform more efficiently. This paper is also trying to give the better approach of reducing makespan of jobshop benchmark problems.