Method for exchanging adjacent processes of quasi-critical path and equipment

Abstract

The invention relates to a method for exchanging adjacent processes of quasi-critical path and equipment, which comprises the following steps of determining a scheduling sequence of each process in aproduct processing process tree by adopting a quasi-critical path strategy, and determining scheduling time of each process by adopting a first adaptation strategy to form an original scheduling scheme; on the basis of the original scheduling scheme, searching for interchangeable adjacent procedures sequentially on each machining equipment; adjusting an interchange process scheduling sequence according to an adjacent process interchange strategy, and meanwhile, adjusting the influenced process; obtaining a new product scheduling scheme; and searching next interchangeable adjacent processes insequence to generate a new product scheduling scheme. And after all the schemes are generated, selecting the scheme with the minimum total processing time as the final product scheduling scheme. According to the algorithm, on the basis of a quasi-critical path strategy, an adjacent process exchange strategy and an adjacent process exchange adjustment strategy are provided, so that the parallel processing efficiency between parallel processes in the scheduling problem is improved and the scheduling result is optimized while the compactness between the serial processes is ensured.

Description

technical field [0001] The invention relates to the technical field of automatic processing, in particular to a method for exchanging a quasi-critical path with adjacent processes of equipment. Background technique [0002] With the continuous development and progress of technology, in recent years, the manufacturing industry has gradually developed to the mode of automated production, and automated production technology has been widely used in the production and processing of enterprises. In automated manufacturing, the product manufacturing scheduling problem is the most difficult combinatorial optimization problem, which has attracted much attention. In actual production and processing, there are often cases where a single piece of complex product is processed in multiple different equipment or in multiple different workshops, so it is necessary to schedule different processing procedures to shorten processing time and improve processing efficiency. The quasi-critical pa...

AI Technical Summary

Problems solved by technology

The current quasi-critical path scheduling algorithm pays too much attention to the serial processing of processes when scheduling complex single products with a tree-like process structure, does not consider the parallel processing between parallel processes, and ignores the impact of the first processing process on the subsequent processing process, resulting in serial processing. The tightness between the row processes is poor, and the parallelism between the parallel processes is poor, which ultimately affects the product scheduling results

Images