Two-workshop flexible integration scheduling method of buffer process migration in advance

Abstract

A two-workshop flexible integration scheduling method of buffer process migration in advance is disclosed. The method comprises the following steps of using a parent path length priority strategy, a long time usage strategy and an available-device less strategy to dynamically determine a scheduling sequence of operations; for a leaf node operation, using a leaf node operation selection strategy to select a processing workshop and processing equipment for the leaf node operation; for buffer operation, using a buffer operation migration strategy in advance to migrate the buffer operation which is processed completely in advance to a processing workshop where other brother operations are located, and waiting a following operation to select processing workshop equipment; and for a nonleaf node operation, using a common operation processing strategy to select the workshop and the equipment with relative early end time for the operation to process. A leading-edge greedy strategy idea is used and a product technology constraint, a migration time constraint and a machine occupation constraint are combined so as to determine final starting time of the operation. The method is used to solve a problem that scheduling of flexible processing equipment exists in a two-workshop integration scheduling method.

Description

technical field [0001] The invention relates to a flexible comprehensive scheduling method for a second workshop in which a buffer process is migrated in advance. Background technique [0002] Aiming at the problem that the flexible processing equipment is not considered in the previous comprehensive scheduling method of the second workshop, starting from obtaining better scheduling results, the proposed solution is to decompose the flexible comprehensive scheduling problem of the second workshop into the scheduling sequence sub-problem and the scheduling path sub-problem. And the sub-problem of scheduling time, for the sub-problem of scheduling sequence, the parent path long-priority strategy, the long-time-consuming strategy and the strategy of less available equipment are used to determine the scheduling sequence of processes; for the sub-problem of scheduling path, the leaf node process selection strategy is adopted, which is the The process selects the processing worksh...

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to provide a flexible comprehensive scheduling method for the second workshop in which the buffering process is migrated in advance. Aiming at the problem that flexible processing equipment is not considered in the existing research on the comprehensive scheduling of the second workshop, a flexible comprehensive scheduling method for the second workshop in which the buffering process is migrated in advance , using the parent path long priority strategy, the long-time strategy and the strategy of less available equipment to determine the scheduling sequence of the process; using the buffer process early migration strategy, the buffer process that meets the conditions is migrated to the workshop where its brother process is located in advance, so that the cross-point process The start time is advanced, and the leaf node process selection strategy and ordinary process processing strategy are used to select processing workshop equipment for the process; the frontier greedy strategy is adopted, and the start time of the process is determined in combination with product process constraints, migration time constraints, and machine occupancy constraints.

Images