An improvement genetic algorithm for solving the job-shop scheduling

This paper studies the Job shop scheduling problem which is a typical NP-hard problem. And this paper brings up an improvement genetic algorithm with Simulated Annealing algorithm. In this paper, firstly, code for GA use the doubly linked list; secondly,the separate cross and variation mechanism of the traditional genetic algorithm was improved by integrating the ideas of both GA and simulated annealing algorithm which putting up with simulated annealing for crossover operation. The results of effectiveness have been shown in simulation experiment by using this algorithm.