CN113626617A - Backlog generation method based on knowledge graph, controller and storage medium - Google Patents
Backlog generation method based on knowledge graph, controller and storage medium Download PDFInfo
- Publication number
- CN113626617A CN113626617A CN202111175535.9A CN202111175535A CN113626617A CN 113626617 A CN113626617 A CN 113626617A CN 202111175535 A CN202111175535 A CN 202111175535A CN 113626617 A CN113626617 A CN 113626617A
- Authority
- CN
- China
- Prior art keywords
- node
- backlogs
- nodes
- backlog
- auditing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Economics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Animal Behavior & Ethology (AREA)
- Computational Linguistics (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application relates to a backlog generation method based on a knowledge graph, a controller and a storage medium, belonging to the technical field of process node processing, wherein the method comprises the following steps: acquiring different process nodes; acquiring a related knowledge base according to the process nodes; obtaining backlogs in the process nodes based on a knowledge base; acquiring an association relation between backlogs; judging whether the flow node has finished backlog or not; and when the completed backlog exists in the process node, activating a new backlog in other process nodes associated with the completed backlog. The method and the device have the advantages that the flexibility of the approval program is improved, and the effect that project progress can be carried out quickly is guaranteed as far as possible.
Description
Technical Field
The present application relates to the field of process node processing, and in particular, to a backlog generation method based on a knowledge graph, a controller, and a storage medium.
Background
When a project or project requires several different procedures (flows) or is completed in several stages, a certain procedure or a certain stage is completed, or a transfer point (category point or time point) at the beginning of another procedure or a certain stage is called a flow node. The process nodes are mainly divided into three main points, namely a start node, a middle node and an end node.
However, in the engineering or project flow, there are often a plurality of intermediate nodes, the flow between the intermediate nodes is performed in sequence, and the approval work or other processing items of the next node can be performed in sequence after the previous node is completed.
In the related art, the inventor believes that the circulation of the project program is performed in the above manner, and the approval program is solidified, so that the project progress is slow.
Disclosure of Invention
In order to improve the flexibility of the approval program and ensure that the project progress can be carried out quickly as much as possible, the application provides a backlog generation method based on a knowledge graph, a controller and a storage medium.
In a first aspect, the present application provides a backlog generation method based on a knowledge graph, which adopts the following technical scheme:
a backlog generation method based on a knowledge graph comprises the following steps:
acquiring different process nodes;
acquiring a related knowledge base according to the process node;
obtaining backlogs in the process nodes based on the knowledge base;
acquiring the association relation between the backlogs;
judging whether the finished backlog exists in the process node or not;
when the completed backlogs exist in the process nodes, activating new backlogs in other process nodes associated with the completed backlogs.
By adopting the technical scheme, different knowledge bases are firstly established, different process nodes are simultaneously acquired, the different process nodes are associated with the corresponding knowledge bases, a plurality of pieces of data are stored in the knowledge bases, corresponding data are called from the knowledge bases according to the corresponding process nodes, backlogs in the corresponding process nodes are generated, the backlogs in the different process nodes are associated correspondingly, when the current process node has the completed backlogs, new backlogs are activated in other process nodes associated with the completed backlogs, the next process node can be accessed without all the backlogs in the current node being completed, the flexibility of an approval program can be improved, and the project progress can be ensured to be performed quickly as far as possible.
Optionally, the activating a new to-do-list in the other flow nodes associated with the completed to-do-list includes:
judging whether the finished flow node where the backlog is located has a feedback item or not;
if yes, based on the correlated backlogs, activating new backlogs in other flow nodes before the flow node where the completed backlogs are located;
if not, based on the correlated backlogs, activating new backlogs in other flow nodes behind the flow node where the completed backlogs are located.
By adopting the technical scheme, new backlogs are activated in other process nodes behind the process node where the completed backlogs are located, the backlogs in the process nodes can be ensured to enter the next process node as soon as possible, the flexibility of an approval program is improved, and the project schedule can be ensured to be carried out quickly as far as possible; and activating new backlogs in other flow nodes before the flow node where the completed backlogs are located, and using the new backlogs to suggest and feed back the completed backlogs in the previous flow nodes, so that problems can be quickly found and solved, and the project completion quality is improved.
Optionally, the obtaining of the association relationship between the backlogs includes the following steps:
associating different backlogs in the same process node;
and performing association among different nodes on the backlogs in different process nodes.
By adopting the technical scheme, the relevance among different backlogs in the same process node can be improved for the same process node, so that the processing efficiency in the process node is further improved, and the progress of a project can be ensured to be carried out quickly as much as possible; the relevance between backlogs of different process nodes can be improved, so that backlogs in different nodes can be independently examined and approved, the examination and approval time can be saved, and the project progress can be rapidly carried out as far as possible.
Optionally, the method further includes:
acquiring the process node where the backlog to be activated is located;
judging whether the last process node associated with the backlog to be activated is the process node in the same process or not;
if yes, activating the corresponding backlog;
and if not, not activating the corresponding backlog.
By adopting the technical scheme, whether the backlogs to be activated are backlogs in the same flow can be determined by judging the previous flow node associated with the backlogs to be activated, and the backlogs not in the same flow do not need to be activated, so that the possibility of error circulation of the flow nodes can be reduced, and the working efficiency can be improved.
Optionally, the method further includes:
judging whether the stay time of the process node is greater than a time threshold value;
and when the stay time of the process node is greater than a time threshold, the process node is transferred to other process nodes for auditing.
By adopting the technical scheme, when the examining and approving personnel of the process node cannot perform the examination and verification in time due to reasons of leaving or asking for leave and the like, when the staying time of the to-be-done items at the process node is longer than the time threshold, the process node is transferred to other process nodes for examination and verification, and the project progress can be ensured to be performed smoothly as far as possible.
Optionally, the step of transferring the flow node to other flow nodes for auditing includes the following steps:
judging the priority of a preset standby auditing node and the priority of a preset automatic auditing node;
when the priority of the standby auditing node is greater than that of the automatic auditing node, the process node is transferred to the standby auditing node;
and when the priority of the standby auditing node is smaller than that of the automatic auditing node, the process node is transferred to the automatic auditing node.
By adopting the technical scheme, the system judges the priorities of the standby audit node and the automatic audit node according to the time threshold, when the priority of the standby audit node is high, the process jumps to the standby audit node for audit, so that the efficiency of audit passing is improved, when the priority of the automatic audit node is high, the process jumps to the automatic audit node, and then the next process node can be entered without audit, so that the flow speed of the process can be further improved, and the progress efficiency of project engineering is improved.
Optionally, the method further includes:
a plurality of standby auditing nodes are arranged;
judging whether the standby auditing nodes which fail to pass exist or not;
and entering the next process node when all the standby auditing nodes pass.
By adopting the technical scheme, the quality of auditing backlog of the process nodes can be improved in a multi-user auditing mode, so that the quality of projects can be improved.
Optionally, the method further includes:
presetting a highest decision node;
when the standby auditing node contains a failure, generating a failure reason report;
and transferring the process node flow corresponding to the failure reason report to the highest decision node for auditing.
By adopting the technical scheme, when disputes exist among a plurality of auditors, the process node generates the failed reason report and transfers the process node containing the failed reason report to the highest decision node, so that the failed node is finally audited, whether the failed node passes or not is finally decided, and the quality of the project is further ensured.
In a second aspect, the present application provides a backlog generation controller based on a knowledge graph, which adopts the following technical solution:
a knowledge-graph-based backlog generation controller, comprising:
a memory storing an intelligent processing program;
a processor capable of executing the steps of any of the above methods when executing the intelligent handler.
By adopting the technical scheme, the memory can store information, and the processor can call the information and send out a control instruction, so that the ordered execution of the program is ensured, and the effect of the scheme is realized.
In a third aspect, the present application provides a computer-readable storage medium, which adopts the following technical solutions:
a computer readable storage medium comprising a computer program stored thereon which can be loaded by a processor and which performs any of the methods described above.
By adopting the technical scheme, after the computer-readable storage medium is loaded into any computer, any computer can execute the backlog generation method based on the knowledge graph.
In summary, the present application includes at least one of the following beneficial technical effects:
1. different knowledge bases are established, different process nodes are obtained, the different process nodes are associated with the corresponding knowledge bases, corresponding data are called from the knowledge bases according to the corresponding process nodes, backlogs in the corresponding process nodes are generated, the backlogs in the different process nodes are associated correspondingly, when the current process node has the completed backlogs, new backlogs are activated in other process nodes associated with the completed backlogs, the next process node can be accessed without all the backlogs in the current node being completed, the flexibility of an approval program can be improved, and the project schedule can be guaranteed to be performed quickly as far as possible.
Drawings
FIG. 1 is a flowchart of a backlog generation method based on a knowledge graph according to an embodiment of the present disclosure;
fig. 2 is a detailed flowchart of the step S5 of associating backlogs in different process nodes according to the embodiment of the present application;
fig. 3 is a detailed flowchart of step S6 in the embodiment of the present application;
FIG. 4 is a flowchart of a step S7 of improving the efficiency of auditing of flow nodes in this embodiment of the present application;
fig. 5 is a detailed flowchart of the step S7 for improving the auditing efficiency of the flow node in this embodiment.
Detailed Description
The present application is described in further detail below with reference to figures 1-5.
The embodiment of the application discloses a backlog generation method based on a knowledge graph.
Referring to fig. 1, the backlog generation method based on the knowledge graph includes the following steps:
s1: acquiring different process nodes;
s2: acquiring a related knowledge base according to the process nodes;
s3: obtaining backlogs in the process nodes based on a knowledge base;
s4: acquiring an association relation between backlogs;
s5: judging whether the flow node has finished backlog or not;
s6: and when the completed backlog exists in the process node, activating a new backlog in other process nodes associated with the completed backlog.
Specifically, different knowledge bases, such as a threat knowledge base, a design knowledge base, a development knowledge base and a test knowledge base, are established in advance, each knowledge base contains one or more pieces of data, and then relevant data among the different knowledge bases are associated. Then, different processes are established according to different projects, wherein the processes are processes of activiti workflows drawn in advance by the background, for example, a process of one project is as follows: the process of standing-demand-design-development-test-deployment-release, and for another example, is as follows: establishing items, requiring, designing, researching and developing, deploying and releasing, acquiring different process nodes in different processes according to different processes, and then associating the corresponding process nodes with different knowledge bases, namely associating data in the knowledge bases with the process nodes. For example, the stand and demand nodes are associated with a threat knowledge base, the design nodes are associated with a design knowledge base, the development nodes are associated with a development knowledge base, and the test nodes are associated with a test knowledge base. The data among all knowledge bases can be associated to form a knowledge graph, and the association relation of the data among all knowledge bases can be more clearly represented through the knowledge graph.
After the association between the knowledge base and the process nodes, after the claimant logs in through the threat knowledge base, the claimant starts to claim and issues requirements, a plurality of design-related backlogs generated in the design database after the requirements are issued are associated to the 'design' process nodes, the design-related backlogs are generated in the 'design' process nodes at the moment, the backlogs are fed back to each project responsible person, the 'backlogs' are displayed when the backlogs are in an incomplete state, and the 'logs' are displayed after the backlogs are completed.
And judging whether the completed backlogs exist in the process nodes, and when one or more backlogs in the current process node show 'completion', namely as long as the completed backlogs exist in the process nodes, activating the backlogs in other process nodes related to the completed backlogs. Therefore, the next process node can be entered without waiting for all backlogs in one process node to be completed, so that the flexibility of the approval program can be improved, and the project schedule can be ensured to be carried out quickly as far as possible. And when the flow nodes do not have the completed backlogs, the corresponding backlogs in other flow nodes are not activated.
Referring to fig. 2, in one embodiment, step S4 includes the following sub-steps:
s41: and associating different backlogs in the same process node.
Specifically, the related backlogs in the same process node are correlated, for example, if the "design" process node has the backlog a-1 and the backlog a-2, the two backlogs are correlated, and if the "design" process node is the correlated two designs, the two backlogs are correlated and then issued to the process node of the same handler, so that the two backlogs are conveniently correlated and designed, the possibility that the correlation of the two final designs is problematic due to the fact that the two designs are distributed to different persons is reduced, the quality of the design is improved, and the final quality of the project is ensured as much as possible.
S42: and performing association among different nodes on backlogs in different process nodes.
Specifically, the backlogs in the current flow node are associated with the backlogs in the flow nodes before and/or after the current flow node. For example, backlogs exist in "development" flow nodes: research and development part A, the to-do matters exist in the flow node of 'design': designing a component A, wherein backlogs exist in a flow node of 'test': the test component a associates the three backlogs in the three flows, and associates the two backlogs of the development component a and the test component a when the partial flow has no "development" flow node, and after the backlog in the previous flow node is completed, the backlog in the previous flow node is changed from "backlog" to "complete", the corresponding backlog in the subsequent flow node is changed to "backlog" state, and then the backlogs in the flow nodes are sequentially performed in this way.
Referring to fig. 3, in one embodiment, step S6 includes the following sub-steps:
s61: and activating new backlogs in other process nodes behind the process node where the completed backlogs are located based on the correlated backlogs.
Specifically, on the basis of step S42, it is determined whether there is a feedback item in the process node where the completed backlog is located, and if not, according to the association relationship of the backlog between the two process nodes, after the backlog of the previous process node is completed, the backlog associated with the previous process node is generated in the subsequent process node and is in a "backlog" state, so as to sequentially process the backlogs associated with each other in different process nodes, thereby ensuring normal promotion of the project as much as possible, saving the time for processing the project, and improving the work efficiency.
S62: and activating new backlogs in other process nodes before the process node where the completed backlogs are located based on the correlated backlogs.
Specifically, in step S42, it is determined whether there is a feedback item in the process node where the completed backlog is located, and if yes, the backlog associated with the previous process node is generated in the previous process node and is in a "backlog" state after the backlog of the next process node is completed according to the association relationship of the backlogs between the two process nodes. For example, after the backlog of the "research and development" process node is completed, the research and development personnel enters the feedback opinions about the design into the research and development process node, at this time, the feedback opinions about the design flow node flow to the "design" process node, at this time, the "design" process node generates the backlog, that is, the processing condition of the related feedback opinions can be timely fed back to the problems and hidden troubles existing in the previous process node, so that the problems existing in the whole project process can be conveniently and timely corrected, the possibility of the problems occurring in the project is reduced, and the completion quality of the project is improved.
Meanwhile, since a plurality of data are stored in the knowledge base and the same data may exist between different knowledge bases, in order to reduce the possibility of errors in flow between processes, the association relationship between the process nodes and the backlog needs to be verified.
When a backlog has finished entering a next process node, acquiring a process node where the next backlog associated with the finished backlog is located, and then judging whether a previous process node associated with the current backlog to be activated is a part of the currently executed overall process, for example, by means of name matching, or judging whether the backlog in the previous process node associated with the current backlog to be activated is matched with the backlog of a corresponding process node in the current overall process, and if so, activating the corresponding backlog; and if not, not activating the corresponding backlog. By the method, the possibility that the backlog flow is transferred to the flow node in the obstructed flow can be effectively reduced, and the accuracy of the flow node transfer is improved.
In the process of each flow node circulation, usually, an auditor is required to audit tasks completed by the nodes, so that the possibility of errors occurring in the flow nodes is reduced. However, the current audit is usually a one-to-one audit, that is, only one auditor is in a node, and for some sudden accidents, the auditor cannot timely handle the sudden accident, which may result in a project delay and affect the progress of the project, so in another embodiment, referring to fig. 4, the following steps are further included:
s7: and transferring the flow node to other auditing nodes.
Specifically, referring to fig. 5, step S7 includes the following sub-steps:
s71: presetting a standby auditing node;
s72: comparing the stay time of the process node with a time threshold;
s73: and transferring the process node to the standby auditing node.
Firstly, a standby auditing node is preset, then a time threshold value is set, and when the staying time of backlog in the current process node is larger than the time threshold value, the auditing flow of the process node is transferred to the standby auditing node for auditing. For example, the time threshold is set to one day, and when the time that the to-do item in the process node stays in the next process node is longer than one day, the system automatically transfers the process node to the standby auditing node, the standby auditing person passes or does not pass after auditing, and generates a reason for failing to return to the previous node, and the reason is modified by the responsible person of the previous node, so that the auditing time can be saved, and the work efficiency can be improved.
In another embodiment, a plurality of standby auditing nodes are provided, for example, two or three standby auditing nodes are provided, when the backlog in the process node flows to the next node for a long time without response, the backlog flows to all the standby auditing nodes at the same time, and when all the standby auditing nodes pass, the next process node is entered.
In another embodiment, step S7 further includes the sub-steps of:
s74: and judging the priority of the nodes.
Specifically, the system presets a standby audit node and an automatic audit node, and in the presetting process, part of the process nodes may be associated with the automatic audit node, and part of the process nodes may not be associated with the automatic audit node. For example, the deployment entry release stage may be associated with an automatic audit node, and when a preset condition is exceeded, the deployment node automatically skips the automatic audit node, and then automatically audits the entry release node.
The preset condition means that the system firstly presets the priorities of the standby auditing node and the automatic auditing node and judges the priorities of the standby auditing node and the automatic auditing node according to time. For example, the preset time is 6 hours, when the time of the to-be-handled items in the standby auditing node is less than or equal to 6 hours, the priority of the standby auditing node is judged to be greater than that of the automatic auditing node, and auditing is only performed through the standby auditing node at the moment; when the time of the backlog in the standby auditing node is longer than 6 hours, the priority of the standby auditing node is judged to be smaller than that of the automatic auditing node, and the backlog is transferred to the automatic auditing node and only audited through the automatic auditing node. By the method, the flow efficiency of the flow nodes and the auditing efficiency of backlogs can be improved, and the progress of project engineering is further improved.
In yet another embodiment, step S7 further includes the sub-steps of:
s75: and circulating the process nodes to the highest decision node for auditing.
Specifically, when there is a failed node in the standby auditing nodes, a failed reason report is generated, and the flow node containing the failed reason report is circulated to a preset highest decision node. The highest decision node can be a general responsible person or a department responsible person of the project, or a company responsible person, the responsible person of the highest decision node checks the failure reason and decides whether to pass or not, if the failure reason passes, the highest decision node enters the next process node, and if the failure reason does not pass, the highest decision node returns to the initial processing node of the process node for modification. Therefore, backlogs in each step of flow nodes can be further detected through the method, the work efficiency can be improved, and the project completion quality can be improved as much as possible.
The implementation principle of the backlog generation method based on the knowledge graph in the embodiment of the application is as follows: the method comprises the steps of firstly establishing different knowledge bases, simultaneously acquiring different process nodes, associating the different process nodes with the corresponding knowledge bases, storing a plurality of pieces of data in the knowledge bases, calling corresponding data from the knowledge bases according to the corresponding process nodes, generating backlogs in the corresponding process nodes, and then associating the backlogs in the different process nodes correspondingly.
The embodiment of the present application further discloses a backlog generation controller based on the knowledge graph, including:
a memory storing an intelligent processing program;
and the processor can execute the steps of the backlog generation method based on the knowledge graph when the intelligent processing program is operated.
The embodiment of the present application further discloses a computer-readable storage medium, which stores a computer program that can be loaded by a processor and executes the above-mentioned knowledge-graph-based to-do-item generating method, and the computer-readable storage medium includes, for example: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above embodiments are preferred embodiments of the present application, and the protection scope of the present application is not limited by the above embodiments, so: all equivalent changes made according to the structure, shape and principle of the present application shall be covered by the protection scope of the present application.
Claims (10)
1. A backlog generation method based on knowledge graph is characterized by comprising the following steps:
acquiring different process nodes;
acquiring a related knowledge base according to the process node;
obtaining backlogs in the process nodes based on the knowledge base;
acquiring the association relation between the backlogs;
judging whether the finished backlog exists in the process node or not;
when the completed backlogs exist in the process nodes, activating new backlogs in other process nodes associated with the completed backlogs.
2. The method of claim 1, wherein activating new backlogs in other flow nodes associated with the completed backlogs comprises:
judging whether the finished flow node where the backlog is located has a feedback item or not;
if yes, based on the correlated backlogs, activating new backlogs in other flow nodes before the flow node where the completed backlogs are located;
if not, based on the correlated backlogs, activating new backlogs in other flow nodes behind the flow node where the completed backlogs are located.
3. The method according to claim 1, wherein the obtaining the association relationship between the backlogs comprises the following steps:
associating different backlogs in the same process node;
and performing association among different nodes on the backlogs in different process nodes.
4. The method of claim 3, further comprising:
acquiring the process node where the backlog to be activated is located;
judging whether the last process node associated with the backlog to be activated is the process node in the same process or not;
if yes, activating the corresponding backlog;
and if not, not activating the corresponding backlog.
5. The method of claim 1, further comprising:
judging whether the stay time of the process node is greater than a time threshold value;
and when the stay time of the process node is greater than a time threshold, the process node is transferred to other process nodes for auditing.
6. The method of claim 5, wherein the flowing the flow node to other flow nodes for auditing comprises the steps of:
judging the priority of a preset standby auditing node and the priority of a preset automatic auditing node;
when the priority of the standby auditing node is greater than that of the automatic auditing node, the process node is transferred to the standby auditing node;
and when the priority of the standby auditing node is smaller than that of the automatic auditing node, the process node is transferred to the automatic auditing node.
7. The method of claim 6, further comprising:
a plurality of standby auditing nodes are arranged;
judging whether the standby auditing nodes which fail to pass exist or not;
and entering the next process node when all the standby auditing nodes pass.
8. The method of claim 7, further comprising:
presetting a highest decision node;
when the standby auditing node contains a failure, generating a failure reason report;
and transferring the process node flow corresponding to the failure reason report to the highest decision node for auditing.
9. A backlog generation controller based on a knowledge graph, comprising:
a memory storing an intelligent processing program;
a processor capable of performing the steps of the method of any one of claims 1 to 8 when running the intelligent handler.
10. A computer-readable storage medium characterized by: comprising a computer program stored thereon which can be loaded by a processor and which performs the method according to any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111175535.9A CN113626617B (en) | 2021-10-09 | 2021-10-09 | Backlog generation method based on knowledge graph, controller and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111175535.9A CN113626617B (en) | 2021-10-09 | 2021-10-09 | Backlog generation method based on knowledge graph, controller and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113626617A true CN113626617A (en) | 2021-11-09 |
| CN113626617B CN113626617B (en) | 2022-03-15 |
Family
ID=78390685
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111175535.9A Active CN113626617B (en) | 2021-10-09 | 2021-10-09 | Backlog generation method based on knowledge graph, controller and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113626617B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101388844A (en) * | 2008-11-07 | 2009-03-18 | 东软集团股份有限公司 | Data flow processing method and system |
| CN104850665A (en) * | 2015-06-12 | 2015-08-19 | 江苏中威科技软件系统有限公司 | Method and system for realizing flow circulation based on flow embedding |
| CN107688922A (en) * | 2016-08-04 | 2018-02-13 | 北京地厚云图科技有限公司 | Project supervision task processing method and device based on node tree |
| CN109784829A (en) * | 2018-12-11 | 2019-05-21 | 平安科技（深圳）有限公司 | Approval process Dynamic Configuration, device, computer equipment and storage medium |
| CN111160847A (en) * | 2019-12-09 | 2020-05-15 | 中国建设银行股份有限公司 | Method and device for processing flow information |
| WO2020146171A1 (en) * | 2019-01-11 | 2020-07-16 | Microsoft Technology Licensing, Llc | Automated suggestions for to-do list reminders via native notifications |
| WO2020263228A1 (en) * | 2019-06-25 | 2020-12-30 | Google Llc | Developing event-specific provisional knowledge graphs |
| CN112329418A (en) * | 2020-11-03 | 2021-02-05 | 平安信托有限责任公司 | Parallel approval method, equipment and computer readable storage medium |
-
2021
- 2021-10-09 CN CN202111175535.9A patent/CN113626617B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101388844A (en) * | 2008-11-07 | 2009-03-18 | 东软集团股份有限公司 | Data flow processing method and system |
| CN104850665A (en) * | 2015-06-12 | 2015-08-19 | 江苏中威科技软件系统有限公司 | Method and system for realizing flow circulation based on flow embedding |
| CN107688922A (en) * | 2016-08-04 | 2018-02-13 | 北京地厚云图科技有限公司 | Project supervision task processing method and device based on node tree |
| CN109784829A (en) * | 2018-12-11 | 2019-05-21 | 平安科技（深圳）有限公司 | Approval process Dynamic Configuration, device, computer equipment and storage medium |
| WO2020146171A1 (en) * | 2019-01-11 | 2020-07-16 | Microsoft Technology Licensing, Llc | Automated suggestions for to-do list reminders via native notifications |
| WO2020263228A1 (en) * | 2019-06-25 | 2020-12-30 | Google Llc | Developing event-specific provisional knowledge graphs |
| CN111160847A (en) * | 2019-12-09 | 2020-05-15 | 中国建设银行股份有限公司 | Method and device for processing flow information |
| CN112329418A (en) * | 2020-11-03 | 2021-02-05 | 平安信托有限责任公司 | Parallel approval method, equipment and computer readable storage medium |
Non-Patent Citations (2)
| Title |
|---|
| ADMIN: "《子流程》", 《简道云》 * |
| XIE: "《监理工程师考点《案例分析》：流水施工进度计划（同步练习）》", 《考无忧网校》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113626617B (en) | 2022-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5890133A (en) | Method and apparatus for dynamic optimization of business processes managed by a computer system | |
| CN104750522B (en) | The Dynamic Execution method and system of task or flow | |
| CN103729171A (en) | Generating method and device of service workflow codes | |
| US8645902B1 (en) | Methods, systems, and computer program products for implementing interactive coloring of physical design components in a physical electronic design with multiple-patterning techniques awareness | |
| CN113626617B (en) | Backlog generation method based on knowledge graph, controller and storage medium | |
| US8010217B2 (en) | Reconfiguration of assets for reuse during manufacturing | |
| US6929962B1 (en) | System and method for wafer acceptance test configuration | |
| CN107885869A (en) | A kind of method and system for changing database | |
| CN107562701A (en) | A kind of data analysis method and its system of steel trade industry stock resource | |
| CN112083952A (en) | Spring architecture-based exception handling method and system | |
| US8863056B2 (en) | Integrated design-for-manufacturing platform | |
| CN114841298B (en) | Method and device for training algorithm model, electronic equipment and storage medium | |
| CN109815129A (en) | Test method, device, terminal and the storage medium of securities finance application software | |
| CN114511234B (en) | Method, system, equipment and readable storage medium for robust configuration of production line resources | |
| CN116579466B (en) | Reservation method and reservation device in wafer processing process | |
| CN116596476B (en) | Method, apparatus and medium for automatic project authorization in chip design and manufacture | |
| JP7319839B2 (en) | Computer system and business flow support method | |
| Asefa et al. | A Review of Automatic Generation of Test Cases from Use Case Specification | |
| CN117539764A (en) | Verification method and device of system on chip, storage medium and electronic equipment | |
| CN106445826A (en) | Preparing method and producing device of differential package | |
| CN114119240A (en) | Financial leasing business verification processing system, method and device | |
| CN116166238A (en) | Data processing model construction method, system and storage medium based on component library | |
| CN114996154A (en) | Internet service flow testing method and device | |
| CN117745207A (en) | Document auditing method and device based on sharing robot and robot | |
| CN116107881A (en) | Renting system interface test optimization method and system based on Jmeter |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |