Genetic algorithm applications on Job Shop Scheduling Problem: A review

Job shop scheduling is an assignment of a number of jobs which are to be processed under a number of machines for certain amount of time. The arrival pattern of the jobs is either known in advance or random. Many approaches like Artificial Intelligence, heuristics, mathematical approaches have been proposed by the researchers to simplify the scheduling tasks. In all the techniques, most of the work is published using Genetic Algorithm (GA). The Job Shop Scheduling Problems (JSSP) ranging from a single machine to flexible JSSP under genetic algorithms have been reviewed. In this paper, a detailed overview of genetic operators and comparison of other techniques with GA have been examined.