Integrated Scheduling Algorithm of Two Workshops Based on Process End Time Driven and Processing Area Priority

Abstract

In order to effectively allocate processes of Aa single complex product to two workshops with the same equipment, an integrated scheduling algorithm of two workshops based on process end time driven and processing area priority is proposed. To optimize the total processing time, a process scheduling strategy based on process end time driven is proposed. By scheduling multiple devices at the same time, the parallelism of process execution is improved, in order to reduce the total processing time and improve the utilization rate of equipment. In order to optimize the process migration times between two workshops, a workshop assignment strategy based on process processing area priority is proposed, which comprehensively considers the influence of the immediate preceding process, neighbor process and friend process of the schedulable process on workshop assignment and makes the process in the same processing area be processed in the same workshop as much as possible, so as to reduce the process migration times. The example analysis shows that the proposed algorithm is superior to the existing two workshops integrated scheduling algorithms in terms of reducing the total processing time, reducing the process migration times, and improving the utilization rate of equipment.

Symmetric Two-Workshop Heuristic Integrated Scheduling Algorithm Based on Process Tree Cyclic Decomposition

“…For multi-variety, small-batch, and complex products, different from the distributed job scheduling problem, this paper studies the distributed integrated scheduling problem. It is a scheduling mode for part processing and assembly synchronically [12][13][14][15][16][17][18] for the tree structure products with constraints between operations.…”

“…At present, in the existing resource-symmetric two-shop integrated scheduling problem, the research results include the balanced processing algorithm of two-shop scheduling processes [13], the allied-critical path algorithm [14], the neighborhood rendering algorithm [15], and the timing-selected algorithm [16]. Through improving horizontal parallel processing of schedulable operations, adopting the long-path method and the long-time method for key operations, neighborhood rendering strategy, and workshop selection strategy of the same equipment, these research results achieved good scheduling effect.…”