Double-dynamic long-path two-workshop comprehensive scheduling method

A scheduling method and long-path technology, applied in the direction of instruments, manufacturing computing systems, data processing applications, etc., can solve the problems of not considering the processed process, unsatisfactory product processing effect, and prolonged product completion time, so as to reduce the consumption of workshop resources , reduce the number of migrations, and achieve good scheduling effects

Inactive Publication Date: 2020-04-28
HARBIN UNIV OF SCI & TECH
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The current comprehensive scheduling method for the second workshop with the same resources does not consider the impact of the processed process in each scheduling process, resulting in prolonged product completion time and unsatisfactory product processing results

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
  • Double-dynamic long-path two-workshop comprehensive scheduling method
  • Double-dynamic long-path two-workshop comprehensive scheduling method
  • Double-dynamic long-path two-workshop comprehensive scheduling method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0034] A dual-dynamic long-path two-shop comprehensive scheduling method, which 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 performed by layer; the dual-dynamic long-path sorting is adopted Strategy pre-scheduling, considering the delayed scheduling of processes caused by equipment occupation during the scheduling process, considering the impact of the end time of the processed processes for each layer of the process set to be scheduled, using a combination of static scheduling and dynamic scheduling to calculate the total path length and Pre-scheduling in descending order, thereby improving the accuracy of scheduling long paths; in order to realize product processing as soon as possible, an average delay strategy is proposed, considering the use of gaps in process processing to make equipment processing compact; in ord...

Embodiment 2

[0036] In the above-mentioned dual dynamic long-path two-shop comprehensive scheduling method, the specific implementation steps of the scheduling method 1 are as follows:

[0037] Specific implementation steps

[0038] Step 1: Enter device and product information.

[0039] Step 2: Obtain n layers of the product processing technology tree.

[0040] Step 3: Let i=1.

[0041] Step 4: Judge whether i≤n is established, if the judgement result is yes, go to step 5; if the judgement result is no, go to step 12.

[0042] Step 5: The current set of processes to be scheduled is O i .

[0043] Step 6: Use the dual dynamic long path sorting strategy to match O i The processes in the scheduling sequence are arranged.

[0044] Step 7: The second workshop selection strategy is O i Arrange workshop processing

[0045] Step 8: Arrange the target process O during pre-dispatch ix The earliest start time of processing is S ix , The required processing time is t ix .

[0046] Step 9: Determine whether there is ...

Embodiment 3

[0051] The above-mentioned dual-dynamic long-path two-shop comprehensive scheduling method uses a dual-dynamic long-path sorting strategy for descending scheduling for each layer of the process tree to be scheduled for the process set, that is, when scheduling comprehensively considers the equipment occupation caused by the scheduled process The impact of process delay scheduling on the process, and calculate the total path length based on this, and finally schedule in descending order.

[0052] In the above-mentioned dual dynamic long-path two-shop comprehensive scheduling method, after the pre-scheduling of the scheduled process at each layer of the process tree, the average delay strategy is applied, and the gap generated between process processing is used to make the equipment processing compact to realize the product Process as soon as possible.

[0053] The above-mentioned dual-dynamic long-path two-shop comprehensive scheduling method, in order to reduce the number of migrat...

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 double-dynamic long-path two-workshop comprehensive scheduling method. The method provided by the invention comprises the following steps: scheduling a processing tree layerby layer; sorting and pre-scheduling each layer of to-be-scheduled process set according to a double-dynamic long-path sorting strategy; aiming at the situation that the procedures may delay machiningdue to the partial order relation between equipment, considering gaps generated during machining of the procedures, and using an average delay strategy for enabling equipment machining to be compact;in order to reduce the number of workshop migration times, using a two-workshop selection strategy for analyzing and arranging a processing workshop for each process. The method is used for two-workshop comprehensive scheduling with the same resources.

Description

Technical field [0001] The invention relates to a dual dynamic long path two workshop comprehensive scheduling method. 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, the proposed solution is: scheduling the processing tree by layer; according to the dual dynamics for each layer to be scheduled The long-path sorting strategy is sorted and pre-scheduled; in view of the possibility of delay in processing due to partial order between equipment, consider the use of gaps generated during processing, and use the average delay strategy to make equipment processing compact; to reduce the number of workshop migrations , Use the second workshop selection strategy to analyze each process and arrange the processing workshop. The existing comprehensive scheduling method for the second workshop with the same resources does not consider...

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/06G06Q10/04G06Q50/04
CPCG06Q10/04G06Q10/06312G06Q10/06316G06Q50/04Y02P90/30
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap