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

A technology of buffering procedures and scheduling methods, applied in data processing applications, forecasting, resources, etc., to achieve the effect of shortening and optimizing product completion time

Inactive Publication Date: 2017-03-08
HARBIN UNIV OF SCI & TECH
View PDF0 Cites 18 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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 s...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Two-workshop flexible integration scheduling method of buffer process migration in advance
  • Two-workshop flexible integration scheduling method of buffer process migration in advance

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0035]A flexible comprehensive scheduling method for two workshops with early migration of buffering processes, characterized in that: the method mainly comprises the following steps: adopting a long-priority strategy for parent paths, a strategy for long-time usage, and a strategy for fewer available equipment, to dynamically determine the scheduling sequence of processes; For the node process, the leaf node process selection strategy is adopted to select the processing workshop and processing equipment for the leaf node process. For the buffer process, the buffer process advance migration strategy is adopted to migrate the completed buffer process to the processing workshop where its sibling process is located in advance, and wait. The processing workshop equipment is selected for the immediate subsequent process. For the non-leaf node process, the common process processing strategy is adopted, and the workshop and equipment processing with a relatively early end time are sele...

Embodiment 2

[0037] The above-mentioned flexible comprehensive scheduling method for the second workshop in which the buffering process is migrated in advance, the specific implementation steps of the scheduling method are as follows:

[0038] Step 1: Input the process information of the product to be processed, initialize the product processing tree, and assign initial values ​​to the parameters of the process;

[0039] Step 2: Determine whether it is the device idle event-driven time, if so, execute step 3, otherwise, wait for the device idle event-driven time in a loop;

[0040] Step 3: determine whether the processing completed process is a buffer process, if so, execute the buffer process advance migration strategy, and execute step 4, otherwise, directly execute step 4;

[0041] Step 4: Determine whether there is a new schedulable process, if not, go to Step 6, otherwise, read the schedulable process and add it to the schedulable process set, and go to Step 5;

[0042] Step 5: adopt...

Embodiment 3

[0051] The above-mentioned flexible and comprehensive scheduling method for the second workshop in which the buffer process is migrated in advance, the leaf node process adopts the leaf node process selection strategy to select the processing workshop equipment for the process, that is, the leaf node process with the highest priority, according to the minimum processing time, in order Equilibrium distribution for processing in two workshops. For the leaf node process with non-highest priority, if the descendant node of its parent node (except the root node) process has arranged a workshop, it will be processed in this workshop; otherwise, the total time spent in selecting the processed process is less Each workshop selects equipment with a smaller completion time for processing.

[0052] The above-mentioned flexible and comprehensive scheduling method for two workshops in which the buffer process is migrated in advance, the buffer process adopts the buffer process early migrati...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06Q10/04G06Q10/06
CPCG06Q10/04G06Q10/06
Inventor 谢志强高一龙
Owner HARBIN UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products