The study of job-shop scheduling problem of adaptive mind evolutionary computation algorithm

JSP is an complex problem in process. This paper brings up an adaptive mind evolutionary computation algorithm, which is based on the researched algorithm. The idea of this method is that useing adaptive convergence operation to adaptive adjustment evolution of the search range and precision. This method of operation can improve efficiency, enhance the direction of evolution, and improve the algorithm´s search capabilities. The adaptive algorithm overcomes the prematurity and the poor results of average fitness and genetic algorithm. Simulation experiment results have shown the effectiveness of this algorithm.