A Hybrid Ant Colony Algorithm In Jsp

The job shop scheduling problem(JSP)is a very important research problem in fields of both production management and combinatorial optimization.Efficient methods for arranging production and scheduling are very important for increasing production efficiency,reducing cost and improving product quality.Therefore,the study of Job Shop Scheduling problem is of great value in both theory and reality.Job Shop problem is the simplified model of many actual job shop schedule problems.It is a typical Nondeterministic Polynomial-time hard problem,which has many complex characteristics,such as constraints,nonlinearity,uncertainty and large scale,and it has been proved that it can't get the best outcome through polynomial.Since Johnson studied this problem for the first time in 1954,there have been many methods for this problem.However,both Exact Algorithm and Heuristic Algorithm have respective limitations.In order to solve the Job Shop problem,using the combination of all algorithms,which can enhance strong points and avoid weaknesses,has become the main research method now.On the basis of summing up the research results of relevant articles,this paper is trying to improve the traditional ant colony optimization algorithm by importing look-back adjacent interchange.At the same time,the updating rules of the overall information of the ant colony optimization algorithm is adjusted,in order to acquire the scheduled programmer of the smallest production cycle.Then,the simulation shows the effectiveness of the algorithm.Each process of each workpiece has to be processed in a fixed machine in the Job Shop problem.However,the problem is much more complicated in real producing environment.This paper do some further research on the flexible job shop scheduling and use the syncretized ant system to solve the problem with single target and multi-target. Finally,the simulation shows the effectiveness of the algorithm.