Intelligent flexible job shop active scheduling method based on hyper-heuristic algorithm

Abstract

The invention belongs to the related technical field of flexible job shop scheduling, and discloses an intelligent flexible job shop active scheduling method based on a hyper-heuristic algorithm, and the method comprises the steps: constructing a flexible job shop scheduling model with job release time, and determining a corresponding fitness function; for a flexible job shop scheduling model, mining optimization is performed on a process sorting rule and an equipment selection rule based on a hyper-heuristic algorithm, and then an active scheduling process of the flexible job shop is realized by adopting the optimized rules. According to the invention, the workshop optimal scheduling rule can be mined according to different workshop environments, and the scheduling scheme generated by the algorithm is in the active scheduling set through the design of the heuristic algorithm, so that the calculation cost of the algorithm is effectively reduced while the optimal scheduling scheme is ensured to be obtained, the calculation efficiency of the algorithm is greatly improved, and the scheduling efficiency of the workshop is improved. Therefore, the method is especially suitable for intelligent flexible job shop application occasions with high scheduling real-time performance requirements.

Description

technical field [0001] The invention belongs to the technical field of flexible job shop scheduling, and more particularly relates to an intelligent flexible job shop active scheduling method based on a hyperheuristic algorithm. Background technique [0002] Scheduling is one of the most critical issues in manufacturing process planning and management. The Job Shop Problem (JSP) can be described as: there are multiple workpieces in the workshop, each workpiece has its own process route, and the process route contains multiple processes, each process can only be processed on one machine tool, and the machine tools can be processed at the same time. Only one workpiece can be machined; the purpose of scheduling is to determine the start and end times of each operation to optimize target performance. Flexible Job Shop Scheduling Problem (FJSP) is a more general case of shop scheduling, where multiple machine tools can be selected for each process, thereby reducing the competiti...

AI Technical Summary

Problems solved by technology

[0004] However, further studies have shown that the above-mentioned existing technologies still have the following deficiencies or defects: first, such scheduling methods often have problems such as high algorithmic calculation costs and insufficient efficiency for different and complex workshop environments; secondly, the current In the existing technology, there is insufficient consideration on how to realize the active scheduling of flexible job workshops, and correspondingly, it cannot meet the requirements of intelligent manufacturing workshops with high real-time scheduling requirements; finally, in the process of introducing algorithms, how to further improve the population diversity without destroying population diversity Speeding up the evolutionary efficiency of algorithms is one of the key issues to be solved in this field

Images