Research On Flexible Open Shop Scheduling And Method Based On Cuckoo Search Algorithm

Flexible open shop scheduling problems are widely applied into manufacturing,such as inspection,repair,and manufacturing.The research on this problem is of great significance.Currently,scholars mainly use the meta-heuristic method to solve the shop scheduling problem.The Cuckoo Search algorithm is a new kind of meta-heuristic method which is widely used because of its simple idea,less control parameters and high robustness.It is widely used in engineering.In this paper,the cuckoo algorithm is used as a method to study the flexible open workshop.Firstly,the single object traditional open shop scheduling and flexible open shop scheduling problem is studied,and mathematical models of flexible open shop scheduling problem are established.According to the problem and the characteristics of the Cuckoo Search algorithm,the Lévy Flights based on the neighborhood structure is proposed to discretize the cuckoo search algorithm to make it available to solve this problem.And the optimal nest and inferior nests are updated through different neighborhood structures,which ensures the balance between global search and local search.Then,combined with the local search of critical path,the Taillard standard instance of traditional open shop scheduling problem and the random constructed example of flexible open shop scheduling problem are solved,and the percentage deviation is compared with other meta-heuristic algorithms to verify the correctness and effectiveness of Cuckoo Search algorithm.Secondly,the multi-objective flexible open shop scheduling problem is studied.The multi-objective optimization problem and the optimization method of multi-objective optimization problem are expounded.Combined with the flexible open shop scheduling problem,a mathematical model of multi-objective flexible open shop problem aiming to minimize the makespan,the mean flow time and minimize the total tardiness is established.According to the characteristics of multi-objective problem optimization,different evolution methods are adopted for the optimal nest and inferior bird nest,and the iterative greedy search process is adopted for the optimal nest,and the complexity of the algorithm is reduced by the fast non-dominated solution construction method.Finally,The constructed instances are solved,and the Pareto solution of the multi-objective optimization problem is obtained,and the AHP is used for decision making.Finally,the dynamic scheduling of multi-objective flexible open shop is studied.According to the concept of dynamic scheduling problem and multi-objective flexible open shop scheduling problem,the mathematical model of multi-objective flexible open shop dynamic scheduling problem is established.Based on rolling horizon rescheduling technology and event-driven rescheduling mechanism,multi-objective is used for real-time events of emergency work orders.The dynamic scheduling of the cuckoo algorithm is verified,and the rescheduling Pareto solution set for decision making is obtained.