Bi-directional intelligent search-based manufacturing enterprise shop scheduling optimization method

Abstract

The invention discloses a bi-directional A*search-based manufacturing enterprise shop scheduling optimization method. The method includes the following steps that: a Petri net model of a system is built according to the processing procedures of the system; the Petri net model is transformed into an input file of the algorithm; related variables such as a identification vector and an incidence matrix are built so as to be used for Petri net evolution and heuristic function construction; the heuristic function of an A*algorithm is constructed; the initial status identifier and terminal status identifier of the system are adopted as the initial statuses of a forward A* algorithm and a reverse A* algorithm, A*search is executed for a terminal status and an initial status; and whether the minimum cost value node of the search algorithm of any direction reaches a final status is judged, or whether the minimum cost value node of the search algorithm at any direction is a node in the OPEN table of the A* search of an opposite direction is judged, if the minimum cost value node of the search algorithm of any direction reaches the final status, or is a node in the OPEN table of the A* search of the opposite direction, an optimal path is constructed from the node to the initial node and terminal node of the system in a backtracked manner, and a scheduling scheme of the system is outputted. With the method of the invention adopted, a small number of nodes are required to be searched, and an optimal scheduling scheme can be found faster.

Description

technical field [0001] The invention belongs to the technical field of workshop operation scheduling, in particular to an optimization method for workshop scheduling of manufacturing enterprises based on bidirectional intelligent search. Background technique [0002] Manufacturing enterprise shop scheduling is a scheduling manufacturing system that includes multiple production tasks and multiple available resources (machines). The workshop scheduling problem of a manufacturing enterprise refers to a given set of jobs, which are required to be completed on a set of machines. Each machine can only process one job at most at any time. The processing of a job on one machine is called a process. Process processing The time of is fixed, and the goal is to find the scheduling scheme with the shortest processing time of all jobs. The efficient scheduling optimization method can implement the scheduling of the manufacturing system conveniently, quickly and effectively; it can shorte...

AI Technical Summary

Problems solved by technology

However, in the one-way A* search algorithm, as the search depth increases, more and more nodes need to be expanded, which makes the calculation process take a lot of time

Images