Research On Open Shop Scheduling Based On Migrating Birds Optimization Algorithm

The migrating birds optimization algorithm is a new heuristic algorithm proposed in recent years.Because the algorithm has simple structure,high robustness and good convergence,it is well studied and concerned by many scholars.In this study,we use the migrating birds optimization algorithm to solve several typical open shop scheduling problems.The main research contents are as follows.Firstly,the traditional open shop scheduling problem is studied.A mixed integer programming model and a disjunctive graph model are established and a new migrating birds optimization algorithm is proposed to solve the problem.The initial solution is generated by the optimal allocation heuristic method,the DS / LTRP strategy and the random generation method.and different neighborhood evolution is designed for the collar birds and with birds.Combined with the key path of local search methods,the Taillard 60 group standard examples and 40 sets of random instances are solved.The validity of the algorithm is verified by comparison with other algorithms.Second,the flexible open shop scheduling is the traditional open shop scheduling and parallel machine problem expansion,it’s more general.Aiming at the problem of single-objective flexible open shop scheduling problem,a migrating birds optimization algorithm for flexible open shop scheduling is proposed.Two kinds of coding sequences are used to express the individual population,and the population evolution mode of different neighborhood structure is designed.A method of local search for critical path is proposed for flexible open shop scheduling.Finally,the examples of different machine scale are solved,and the calculation formula of the lower bound of manufacturing period is given.By comparing the relative percent deviation PRD with other algorithms,the validity of the proposed algorithm is studied.Then,in order to close the actual production process,the multi-target flexible open shopscheduling problem to carry out research.Based on the previous chapters,a multi-objective flexible open-shop scheduling model with minimum maximum completion time and minimized advance / tardy penalty is established,and the mathematical expression formula of the model is listed.A multi-objective migrating birds optimization algorithm is proposed to solve this problem.A iterative greedy local search algorithm is proposed for multi-objective flexible scheduling problem with non-dominated solution set construction method.Finally,the concrete examples are solved and the Pareto solution and satisfactory solutions of different scale instances are obtained.Finally,in order to combine the theoretical research with the actual process,an intelligent dispatching system for open shop flexible detection is developed.This study lists the software runtime interface and describes the main functional components and workflows of the system.Finally,the concrete case is solved and the practicability of the system is verified.