Unlock instant, AI-driven research and patent intelligence for your innovation.

Multi-workshop comprehensive scheduling method based on K shortest path

A technology of the shortest path and scheduling method, applied in the direction of instruments, manufacturing computing systems, data processing applications, etc., can solve problems caused by migration without consideration, achieve the effect of solving the dual-objective problem of time and cost, and balance the scheduling results

Active Publication Date: 2019-09-13
HARBIN UNIV OF SCI & TECH
View PDF14 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to solve the current multi-workshop comprehensive scheduling method only considering the problems caused by the processing of products on different equipment and only considering the problems caused by the products themselves during the processing process, without considering the problems caused by migration. Therefore, a kind of Multi-workshop Synthetic Scheduling Method Based on K Shortest Path

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
  • Multi-workshop comprehensive scheduling method based on K shortest path
  • Multi-workshop comprehensive scheduling method based on K shortest path
  • Multi-workshop comprehensive scheduling method based on K shortest path

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0041] A multi-workshop comprehensive scheduling method based on the K shortest path, which is characterized by: based on the idea of ​​the K shortest path, the migration constraints and equipment resource constraints are integrated; the attribute fusion strategy is used to solve the dual-objective bias problem of time and cost , making the scheduling result more balanced;

Embodiment 2

[0043] The multi-workshop integrated scheduling method based on the K shortest path, the specific implementation steps of the integrated scheduling method are as follows:

[0044] Step 1: Obtain the processing tree information of the product to be processed;

[0045] Step 2: Select the root node of the processing technology tree. Traverse the thought according to the post-order, traverse the processing tree tree, and output the traversal result;

[0046] Step 3: Construct a network structure diagram according to the order of traversal results and the equipment resource constraints of each process;

[0047] Step 4: Enter the device migration constraints, and assign values ​​to each path according to the device migration information;

[0048] Step 5: Call the disjunctive graph model considering the migration problem, and calculate the out-degree and in-degree values ​​of each node;

[0049] Step 6: For each node, calculate the specific gravity value, add and multiply the attr...

Embodiment 3

[0062]The processing technology tree has migration constraints and equipment resource constraints, and the information of each node in the processing technology tree is respectively expressed as the process name, equipment name, processing time (hours), and required cost (ten yuan). The processing relationship between each process is indicated by the direction of the arrow, and the direction pointed by the arrow is the subsequent process of the processing node; for example: J11 / A1 / 13 / 40 means that the process is J11 process, and the processing equipment number is in workshop A No. 1 equipment, the processing time is 13 hours, and the processing cost is 400 yuan.

[0063] The processing procedure can be processed on different processing equipment, and the time and cost spent in the processing process are different.

[0064] The K-shortest path-based multi-workshop comprehensive scheduling method is characterized in that: Aiming at the relationship constraints between the proces...

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

When complex single products are distributed to multi-workshop flexible equipment to be machined, corresponding time and cost are consumed when machining procedures are migrated in workshops and amongthe workshops. The method comprises the following steps: firstly, aiming at two problems of migration constraint and equipment resource constraint, designing a disjunction graph model considering migration and equipment resource problems based on the thought of a K shortest path; secondly, designing an attribute fusion strategy for the problem that in the scheduling process, only one single target is preferentially considered for scheduling, so that the selected path attribute value is more balanced.

Description

technical field [0001] The invention relates to a multi-workshop comprehensive scheduling method based on the K shortest path. Background technique [0002] Multi-workshop flexible integrated scheduling is defined as: a complex single product with a tree-like structure in the processing technology diagram, and its process nodes can be processed on one or more devices in the equipment resources (the processing time and cost can be different), and there are There are multiple workshops, and the equipment resources in each workshop are different. [0003] The current multi-workshop comprehensive scheduling method based on flexible equipment processing only considers the problems caused by the processing of products on different equipment, and does not consider the increase in total time and total cost caused by the migration of processing procedures between multiple workshops and equipment within the same workshop. question. Contents of the invention [0004] The purpose of...

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/06G06Q50/04
CPCG06Q10/047G06Q10/0631G06Q50/04Y02P90/30
Inventor 谢志强裴莉榕宋功鹏
Owner HARBIN UNIV OF SCI & TECH