A flexible job shop batch flow scheduling method with topological neighborhood structure

Abstract

The present invention belongs to the technical field related to scheduling theory in workshop manufacturing processes. It discloses a flexible job shop batch flow scheduling method with a topological neighborhood structure. The method establishes a three-dimensional disjunctive graph encoding model for the flexible job shop batch flow scheduling problem. According to the high-dimensional and complex characteristics of the three-dimensional disjunctive graph, a fast decoding method based on topological sorting is designed to convert the high-dimensional and complex spatial graph of the flexible job shop batch flow scheduling into an expression form of a linear topological linked list. The floating time method is combined to design a critical path determination method to reduce decoding time. For key nodes on the critical path, two neighborhood perturbation operations in the designed topological neighborhood structure are used to efficiently and stably output feasible neighborhood solutions, effectively perform high-quality neighborhood perturbations in a relatively short time, and avoid the generation of infeasible solutions, thereby reducing the computing resource consumption of subsequent feasibility determinations and improving the search performance of the solution algorithm.