Comprehensive scheduling method based on Dijkstra algorithm
A scheduling method and algorithm technology, applied in computing, manufacturing computing systems, instruments, etc., can solve the problems of horizontal and vertical optimization, ignoring the impact of scheduling effects, and low utilization of processing equipment
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0095] For further setting forth method of the present invention, design complex product process tree such as figure 2 As shown, there are 11 layers and 27 processing steps. It should be noted that this calculation example does not specifically refer to a certain type of product, and the method described in the present invention is also applicable to other complex products with small batches and multiple varieties.
[0096] will be like figure 2 The complex product process tree shown is converted into a directed graph with the processing time of the process itself as the path value, as shown in image 3 shown.
[0097] 1. Path and path value of each process
[0098] Calculated according to the improved Dijkstra algorithm as image 3 Table 1 shows the paths and path values from the root node process to each node process in the directed graph of the complex product process tree shown.
[0099] Table 1 Statistical table of paths and path values from the root node proce...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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