Abstract
This paper introduces a method for solving Flexible Shop Scheduling Problem (FJSP) based on complex network model by ant colony algorithm. In this method, the FJSP is abstracted into a complex network model, and the condition of the FJSP is mapped onto a complex network. In order to accurately describe the actual state of the processing unit and improve the accuracy of the result, we introduce the dynamic weight in the model. At the same time, we adjust the path selection method and pheromone update rule of ant colony algorithm according to the characteristics of FJSP complex network model to improve the efficiency of the algorithm and avoid local optimization. At last, we verify the relationship between weight and pheromone concentration and compare its maximum completion time with the traditional ant colony algorithm.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
