Comprehensive scheduling method based on Dijkstra algorithm

Abstract

The invention provides a comprehensive scheduling method based on a Dijkstra algorithm, and the method comprises the steps: extracting the processing time of each process according to the natural attribute of a complex product process, and carrying out the path assignment of all processes; calculating a layer priority, an equipment priority and a process constraint degree of each process; according to a Dijkstra algorithm, respectively calculating path values from the root node process to all other processes; and according to the path value judgment strategy, the layer priority judgment strategy and the leaf node process judgment strategy, reversely scheduling each process according to the shortest path principle. The method provided by the invention provides a new method for solving comprehensive scheduling of general complex products, expands thinking for further deep research on comprehensive scheduling, and has certain theoretical and practical significance.

Description

technical field [0001] The invention relates to the technical field of computer integrated manufacturing, in particular to an integrated scheduling method based on Dijkstra algorithm. Specifically, the self-processing time of complex product processing procedures is used as the path value of the improved Dijkstra algorithm, and a comprehensive scheduling method is constructed with layer and leaf node priority scheduling strategies. Background technique [0002] The scheduling problem of product manufacturing is an important factor affecting the production efficiency of the manufacturing industry. Under the premise of fixed conditions such as enterprise equipment and resources, the efficiency of scheduling directly determines the production efficiency of the enterprise. In order to better solve the scheduling problem of small-batch and multi-variety production, some experts and scholars proposed a comprehensive scheduling that handles product processing and assembly together,...

AI Technical Summary

Problems solved by technology

[0003] Although the existing comprehensive scheduling algorithm has achieved good research results, there are still problems in the horizontal and vertical optimization.

For example, the dynamic Job-Shop method based on ACMP and BFSM proposes a critical path algorithm based on the longitudinal processing process, but ignores the parallel processing capability of the equipment; the method of closely linking the linkage of process groups proposes to determine the scheduling by the total number of processes The algorithm of path and sequence, but ignores the impact of the scheduling of leaf node processes on the overall scheduling effect; the timing method considering the compactness of serial processes proposes an algorithm that takes the number of serial processes as the sorting strategy, but ignores the processing of the process itself The impact of time usage on the overall scheduling effect

[0004] Aiming at the low utilization rate of processing equipment and the existence of many idle time periods in many comprehensive scheduling methods, an improved Dijkstra algorithm is proposed that uses the processing time of the process itself as the path assignment, and constructs a priority scheduling strategy based on layers and leaf nodes comprehensive scheduling method

Images