Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Two-workshop comprehensive scheduling method capable of dynamically guaranteeing critical path procedure scheduling

A critical path and process scheduling technology, applied in data processing applications, forecasting, instruments, etc., can solve problems such as long process paths, achieve good scheduling results, reduce the scope of process adjustments, and reduce the number of workshop relocations

Active Publication Date: 2019-08-02
HARBIN UNIV OF SCI & TECH
View PDF10 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Aiming at the problem that the existing research ignores the influence of the scheduled process on the scheduled process, a second workshop comprehensive scheduling method that dynamically guarantees the critical path process is proposed, considering the impact of the scheduled process, combining static scheduling with dynamic scheduling, and adopting dynamic forward scheduling. Pre-scheduling of the sequence processing time strategy, and adopting the same-level process adjustment strategy to ensure the longest process path on the critical path; when the workshop relocation action occurs, the delay selection strategy is used to ensure that the total processing time is not increased. of workshop relocations

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 comprehensive scheduling method capable of dynamically guaranteeing critical path procedure scheduling
  • Two-workshop comprehensive scheduling method capable of dynamically guaranteeing critical path procedure scheduling
  • Two-workshop comprehensive scheduling method capable of dynamically guaranteeing critical path procedure scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0035] A kind of comprehensive dispatching method for the second workshop that dynamically guarantees the scheduling of the critical path process is characterized in that: the method mainly includes the following steps: according to the structure of the process tree, the number of layers is set from the leaf node to the root node and the scheduling is carried out by layer; Pre-scheduling of sequential processing time strategy, considering the end time of the processed process for each layer of the process set to be scheduled, using the combination of static scheduling and dynamic scheduling to calculate the path length and pre-scheduling in descending order, the length is the estimated total processing of the product Time; when the calculated value of the process on the critical path is not the longest, that is, the process on the critical path is delayed at this moment, the process adjustment strategy on the same level is used to generate a set of alternative solutions, and the...

Embodiment 2

[0037] The above-mentioned comprehensive scheduling method for the second workshop that dynamically guarantees the scheduling of critical path procedures, the specific implementation steps of the scheduling method 1 are as follows:

[0038] Specific implementation steps

[0039] Step 1: Input product processing information, mark the number of layers for the product processing tree process, set the product to have n layers, i=1, indicating that the current scheduling layer is the i-th layer;

[0040] Step 2: Determine whether i

[0041] Step 3: Apply the dynamic pre-sequence processing time strategy to sort the processes of the i-th layer, obtain the scheduling sequence of the processes, and enter the queue Q sequentially i ;

[0042] Step 4: Queue Q i Dequeue in sequence, and pre-schedule in the Gantt chart according to the dequeue order;

[0043] Step 5: Judging the current process Q in the pre-scheduling proce...

Embodiment 3

[0051] The above-mentioned comprehensive scheduling method for the second workshop that dynamically guarantees the scheduling of critical path processes uses a dynamic pre-order processing time strategy for scheduling in descending order for each layer of the process set to be scheduled in the process tree. The impact of the process, and based on this, the path length is calculated, and finally scheduled in descending order.

[0052] The above-mentioned comprehensive scheduling method for the second workshop that dynamically guarantees the process scheduling of the critical path, after the pre-scheduling of the process to be scheduled at each layer of the process tree, the processing sequence is adjusted according to the judgment result, that is, after each pre-scheduling is completed, the judgment Whether the process path length of the initial critical path in this layer is the longest, if it is not the longest, use the same layer process adjustment strategy to adjust, adjust ...

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

The invention discloses a two-workshop comprehensive scheduling method capable of dynamically guaranteeing critical path procedure scheduling. The method comprises the following steps: dividing a to-be-scheduled process set for a processing tree layer by layer; sequencing and pre-scheduling each layer of to-be-scheduled process set according to a dynamic preorder processing time strategy; in orderto reduce the migration frequency of the second workshop process, when the second workshop process is scheduled to a fork point process, starting a delay selection strategy; and after the pre-scheduling is finished, comprehensively considering the influence of the scheduled process, judging whether the path of the key path in the layer is the longest, and starting a process adjusting strategy onthe same layer to adjust the process scheduling sequence of the layer when the judgment result is no. The method is used for two-workshop comprehensive scheduling with the same resources.

Description

technical field [0001] The invention relates to a comprehensive scheduling method for the second workshop that dynamically guarantees the process scheduling of the critical path. Background technique [0002] There have been studies on the comprehensive scheduling problem of the second workshop with symmetrical resources. Starting from the goal of obtaining better scheduling results, a solution is proposed: set the number of layers in the product processing tree, arrange processing according to the layer as a process; and then use dynamic pre-order processing The time strategy arranges the processing sequence for each layer of the process set to be scheduled; the delay selection strategy reduces the number of workshop migrations; when the status of the longest process path on the critical path is changed, the same layer process adjustment strategy is activated. At present, there is an integrated scheduling method for the second workshop with the same resources. Since the key...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/04G06Q10/06
CPCG06Q10/04G06Q10/06316
Inventor 谢志强贾晴王炳进
Owner HARBIN UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com