Development process management method based on knowledge graph

Through the knowledge graph-based development process management method, abnormal dependencies are identified and adjusted, and task priorities are optimized. This solves the problem of delayed response to task execution status and plan deviations in existing technologies, and improves the flexibility and controllability of project management.

CN120653256AInactive Publication Date: 2025-09-16GUANGDONG GUOSHI TECHNOLOGY CO LTD
0 Cites 1 Cited by

Patent Information

Application Number
CN202510778975.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-06-12
Publication Date
2025-09-16
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

The existing development process management lacks a dependency chain adaptive identification mechanism, which leads to delayed response to task execution status and plan deviations, unclear task priorities, resource conflicts and response delays, and unreasonable task scheduling, which affects the project delivery cycle.

Method used

The knowledge graph-based development process management method obtains the actual start time of WBS nodes, identifies abnormal dependencies, recursively eliminates abnormal paths, updates the project network diagram, generates baseline plan snapshots, adjusts task priorities, uniformly updates dependency and priority status, and performs visual output.

Benefits of technology

Accurately expose potential construction period risks, enhance scheduling flexibility, unify dependency status expression, improve project management execution rigidity and plan controllability, and improve response efficiency.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The invention relates to the technical field of development process management, in particular to a knowledge graph-based development process management method, which comprises the following steps of: acquiring actual starting time and earliest starting time, identifying an abnormal path, updating a network relationship, sorting node priorities, adjusting a completion time limit, reconstructing a view and visually outputting the view. According to the method, a dependency path with negative total floating time is dynamically recognized in combination with a knowledge graph, the potential construction period risk is accurately exposed, node logic continuity is enhanced through dependency chain recursion rejection and network structure reconstruction, task priorities are clearly divided by utilizing topological sorting and a WBS hierarchy depth two-dimensional sorting mechanism, scheduling sequence disorder is avoided, and task scheduling efficiency is improved. A comparison mechanism of the latest completion time and the available construction period is introduced, potential delay nodes are identified in advance, the scheduling flexibility is improved, standardized visual expression is performed after a dependency state is uniformly updated, the perceptibility and response efficiency of a development state are enhanced, and the execution rigidity and plan controllability of project management are enhanced.
Need to check novelty before this filing date? Find Prior Art