CN111860885B - Method for identifying process route abnormality - Google Patents
Method for identifying process route abnormality Download PDFInfo
- Publication number
- CN111860885B CN111860885B CN202010645639.0A CN202010645639A CN111860885B CN 111860885 B CN111860885 B CN 111860885B CN 202010645639 A CN202010645639 A CN 202010645639A CN 111860885 B CN111860885 B CN 111860885B
- Authority
- CN
- China
- Prior art keywords
- route
- identified
- routes
- identifying
- check
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 184
- 230000005856 abnormality Effects 0.000 title claims description 8
- 230000002159 abnormal effect Effects 0.000 claims abstract description 13
- 230000000295 complement effect Effects 0.000 claims description 7
- 238000004519 manufacturing process Methods 0.000 abstract description 17
- 238000012795 verification Methods 0.000 abstract description 14
- 239000002699 waste material Substances 0.000 abstract description 2
- 238000007726 management method Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 230000001174 ascending effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Classifications
-
- 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/20—Administration of product repair or maintenance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Software Systems (AREA)
- Economics (AREA)
- Computational Linguistics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for identifying abnormal process routes, and belongs to the technical field of production process verification. Firstly, drawing all working procedures in a process route into a working procedure association table, then, identifying all routes in the process route by using the association table, carrying out route disconnection check or route closing check or route short circuit check on the identified route set, and finally outputting a check result. The automatic verification method avoids the possibility of time and labor waste and mistakes of manual verification under the conditions of large number of working procedures and limited manual verification capability, can strengthen the process management capability, and reduces the influence of abnormal process routes on subsequent work.
Description
Technical Field
The invention relates to the technical field of production process verification, in particular to a method for identifying abnormal process routes.
Background
Along with the rapid development of informatization technology in China, many enterprises realize paperless office work. Compared with the traditional office mode, the resource sharing and information interaction among enterprises and among departments inside the enterprises greatly improve the working efficiency and facilitate enterprise management. Although paperless office work can handle each work task well, unavoidable human operational errors still exist, and some errors are fatal.
For the production enterprises, any production order is not separated from the production process, if the production process route is abnormal, the subsequent production plan and production execution are greatly influenced, the process route is not invariable, and the process route is continuously and iteratively improved, so that in the existing production management systems of all enterprises, the abnormal production route is difficult to avoid, the time and the labor are wasted only by manual investigation, the problem can be found only when the production plan is formulated, the problem is fed back to the process department, the working efficiency is influenced, and the repeated verification flow is shown in figure 1. The identification of the process route abnormality in the process management is a very important link, and a good verification method can strengthen the process management capability and reduce the influence of the process route abnormality on subsequent work.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a method for identifying abnormal process route.
In order to solve the technical problems, the invention adopts the following technical scheme: the process route abnormality identification method has a flow shown in fig. 2 and comprises the following steps:
step 1: all procedures P in the process route i (i=1, 2,) to the N, N e N x) to a process association table;
step 2: after the process association table is imported, all routes in the process routes are identified and stored as a route set W= [ L ] to be identified 1 ,L 2 ,......,L n ],n∈N * ；
Step 2-1: setting a process set C and a route set W to be identified, initializing to be empty, finding out all first sequences in the process according to a process association table, and adding the first sequences into the process set C and the route set W to be identified;
step 2-2: identifying each process P in the process set C i (i=0, 1,) a.m, m e N x) next set NextP i If Next is i Is not empty, find P from the set of routes W to be identified i Route set L for tail order i Traversing the next set Next i Will Next P i Each step of adding to the route set L i A new route set newl is formed, and the route set L in the route set W to be identified is updated with the new route set i Will P i Deleted from C by C.u.NextP i Updating the working procedure set C;
step 2-3: judging whether the process P repeatedly appears in the new route set newl i Or judge the next set Next P i Whether the route set is an empty set or not, if one of the two conditions is satisfied, a route set L corresponding to a route set newl i The marked ending change;
step 2-4: emptying Next P i 、L i Newl;
step 2-5: if the route set W to be identified changes, repeating the steps 2-2 to 2-4; otherwise, the identification is ended.
The route identification method in the step 2 adopts breadth-first search concept, but the algorithm logic structure is different from classical path planning algorithms such as a shortest path Dijkstra algorithm, a minimum spanning tree Prim algorithm and the like, and the purpose of the route identification method is to find out all routes in the whole process, and a plurality of starting points and end points are allowed to exist in a process route diagram, wherein the time complexity is O (nlogn).
Step 3: performing a route disconnection check or a route closing check or a route short-circuit check on the identified route set W;
the process line disconnection refers to a process of a product, wherein the process line is in a discrete rather than continuous state, and the process is not in a fully-correlated structure. The process management system is used for establishing a production process, wherein the occurrence of route disconnection causes the whole process to be divided into two or more parts, and some process management systems cause the lack of process association due to human negligence when the production process is established, namely, two processes which are supposed to be associated are not set. This can result in a product having multiple unrelated process routes, an unusual process configuration for a production plan.
The route disconnection check includes the steps of:
s3-1-1: setting an identified association procedure set U and initializing to be empty;
s3-1-2: u performs traversal on W, and updates the identified related procedure set U and the route set W to be identified;
the process of updating the identified related procedure set U and the route set W to be identified is as follows: each route in W intersects with U, and when the intersection is not empty, the route again merges with U and updates U, deleting the route from W.
S3-1-3: if U changes and W is not null, repeating S1-2 until W is null, ending the traversal, and no disconnection abnormality exists; if U is unchanged and W is not null, the U and W are in a disconnected relation, the rest routes in W are not associated with U, the traversal is finished, and U and W are output.
The closed loop of the route means that a circulation structure occurs in the process route, which is abnormal in the process route if it is a conventional route, but is allowed to exist if it is a specific route such as a defective rework. Thus, the closed loop structure is abnormal for production plans that consider only conventional routes.
The method for checking the route closure comprises the following steps: and verifying all routes in the route set W to be identified, and extracting a closed loop route when repeated procedures appear in the routes.
The route short circuit refers to a structure similar to a circuit short circuit in a process route. For example, there are two routes from one process to the other, if the two routes are in an alternative relationship, one route has no process, and the other route has a process, the route with the process loses meaning; if the two routes are in parallel, the two kinds of upward discharge materials are respectively distributed to different routes, and the route structure is abnormal-free. In any case, the route structure is first identified and then determined according to the route relation.
The route short circuit check includes the steps of:
s3-2-1: selecting two routes L from a set W of routes to be identified i And L j I=1, 2, & gt, n, j=1, 2, & gt, n, i+.j, judgment L i And L j Whether or not there is a child relationship;
the judgment L i And L j The process of whether the sub-genus relationship exists is as follows: when (when)Description of time L i Cause L j Short circuit.
S3-2-2: if L i And L j With sub-genus relationship, calculate L i Complement of (a)The process in complement Z is routed L i A short circuit; otherwise, the process has no short circuit structure.
Step 4: outputting the checking result.
The beneficial effects of adopting above-mentioned technical scheme to produce lie in:
1. the method provided by the invention can basically eliminate abnormal feedback of the process in the later production planning link by assisting the manual verification of the process route through the system;
2. the invention is suitable for any complex process, and avoids the possibility of time and labor waste and errors of manual verification under the conditions of large number of working procedures and limited manual verification capability;
3. the method of the invention is used for automatic verification, is more suitable for the information technology era which is developed rapidly at present, and is more suitable for paperless office work;
4. and the production management intelligence level of enterprise informatization systems such as ERP, APS, MES is improved.
Drawings
FIG. 1 is a conventional process route verification flow in the background of the invention;
FIG. 2 is a flow chart of a method for identifying process route anomalies according to the present invention;
FIG. 3 is a schematic view of a process route according to an embodiment of the invention;
FIG. 4 is a schematic view of a process route in a second embodiment of the present invention;
FIG. 5 is a schematic view of a process route in a third embodiment of the present invention.
Detailed Description
The following describes in further detail the embodiments of the present invention with reference to the drawings and examples. The following examples are illustrative of the invention and are not intended to limit the scope of the invention.
Example 1:
the schematic diagram of the process route in this embodiment is shown in FIG. 3, from which it can be seen that P 6 And P 7 The association of the present should not be set, resulting in the whole process route being divided into two parts, the process route being disconnected. The verification of the process route discontinuity phenomenon shown in fig. 3 is described in detail below.
Step 1: the process in FIG. 3 will be describedAll procedures P in the route i (i=1, 2.,. The term.,. N, N e N) is plotted as a process association table, as shown in table 1;
table 1 process correlation table of process routes in fig. 3
| Step number | Ascending set | Descending order set |
| P 1 | None | P 3 |
| P 2 | None | P 4 |
| P 3 | P 1 | P 6 |
| P 4 | P 2 | P 6 |
| P 5 | None | P 6 |
| P 6 | P 3 ,P 4 ,P 5 | None |
| P 7 | None | P 8 |
| P 8 | P 7 | P 10 |
| P 9 | P 7 | P 11 |
| P 10 | P 8 | P 12 |
| P 11 | P 9 | P 12 |
| P 12 | P 10 ,P 11 | None |
Step 2: after the process association table is imported, all routes in the process routes are identified and stored as a route set W= [ L ] to be identified 1 ,L 2 ,......,L n ],n∈N * ；
Route 1: p (P) 1 →P 3 →P 6
L 1 ＝[P 1 ,P 3 ,P 6 ]
Route 2: p (P) 2 →P 4 →P 6
L 2 ＝[P 2 ,P 4 ,P 6 ]
Route 3: p (P) 5 →P 6
L 3 ＝[P 5 ,P 6 ]
Route 4: p (P) 7 →P 8 →P 10 →P 12
L 4 ＝[P 7 ,P 8 ,P 10 ,P 12 ]
Route 5: p (P) 7 →P 9 →P 11 →P 12
L 5 ＝[P 7 ,P 9 ,P 11 ,P 12 ]
Obtaining a route set W= [ L ] to be identified 1 ,L 2 ,L 3 ,L 4 ,L 5 ]。
Step 3: performing route disconnection check or route closing check or route short circuit check on the route set W to be identified;
s3-1-1: setting an identified association procedure set U and initializing to be empty;
s3-1-2: u performs traversal on W, and updates the identified related procedure set U and the route set W to be identified;
each route in W intersects with U, and when the intersection is not empty, the route again merges with U and updates U, deleting the route from W.
S3-1-3: if U changes and W is not null, repeating S1-2 until W is null, ending the traversal, and no disconnection abnormality exists; if U is unchanged and W is not null, the U and W are in a disconnected relation, the rest routes in W are not associated with U, the traversal is finished, and U and W are output.
The first pass in this embodiment: u identifies W, W= [ L ] 1 ,L 2 ,L 3 ,L 4 ,L 5 ]
1.U∩L 1 And u= []
U＝L 1 ＝[P 1 ,P 3 ,P 6 ],W＝[L 2 ,L 3 ,L 4 ,L 5 ]
2.U∩L 2 →[P 1 ,P 3 ,P 6 ]∩[P 2 ,P 4 ,P 6 ]＝[P 6 ]
U＝U∪L 2 →[P 1 ,P 3 ,P 6 ]∪[P 2 ,P 4 ,P 6 ]＝[P 1 ,P 2 ,P 3 ,P 4 ,P 6 ],W＝[L 3 ,L 4 ,L 5 ]
3.U∩L 3 →[P 1 ,P 2 ,P 3 ,P 4 ,P 6 ]∩[P 5 ,P 6 ]＝[P 6 ]
U∪L 3 →[P 1 ,P 2 ,P 3 ,P 4 ,P 6 ]∪[P 5 ,P 6 ]＝[P 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ],W＝[L 4 ,L 5 ]
4.U∩L 4 →[P 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ]∩[P 7 ,P 8 ,P 10 ,P 12 ]＝[]U and W are unchanged
5.U∩L 4 →[P 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ]∩[P 7 ,P 9 ,P 11 ,P 12 ]＝[]U and W are unchanged
U= [ before first traversal ]]U= [ P ] after the first traversal 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ]After the first time of traversing U changes, the second time of traversing is executed, U identifies W, and W= [ L ] 4 ,L 5 ]
1.U∩L 4 ＝[P 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ]∩[P 7 ,P 8 ,P 10 ,P 12 ]＝[]U and W are unchanged
2.U∩L 5 ＝[P 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ]∩[P 7 ,P 9 ,P 11 ,P 12 ]＝[]U and W are unchanged
U= [ P ] before the second traversal 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ]，
After the second traversal, U= [ P ] 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ]After the second traversal U is unchanged, and
W＝[L 4 ,L 5 ]≠[]and finishing traversing, wherein the rest routes in W are combined together:
i.e. L 4 ∪L 5 ＝[P 7 ,P 8 ,P 9 ,P 10 ,P 11 ,P 12 ]。
Step 4: outputting the inspection result to obtain [ P ] 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ]And [ P ] 7 ,P 8 ,P 9 ,P 10 ,P 11 ,P 12 ]No association.
If all the procedures in this embodiment are related, there is no disconnection, and the obtained test result will be: u= [ P ] 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 ,P 7 ,P 8 ,P 9 ,P 10 ,P 11 ,P 12 ],W＝[]。
Example 2:
the schematic diagram of the process route in this embodiment is shown in FIG. 4, from which it can be seen that P 8 、P 10 、P 12 、P 11 And P 9 The route closed loop exists between the two, and the specific verification process is as follows:
step 1: all procedures P in the process route pattern 4 i (i=1, 2.,. The term.,. N, N e N) is plotted as a process association table, as shown in table 2;
table 2 procedure association table of procedure route in fig. 4
Step 2: after the process association table is imported, all routes in the process routes are identified and stored as a route set W= [ L ] to be identified 1 ,L 2 ,......,L n ],n∈N * ；
Step 2-1: setting a process set C and a route set W to be identified, initializing to be empty, finding out all first sequences in the process according to a process association table, and adding the first sequences into the process set C and the route set W to be identified;
step 2-2: identifying each process P in the process set C i (i=0, 1,) a.m, m e N x) next set NextP i If Next is i Is not empty, find P from the set of routes W to be identified i Route set L for tail order i Traversing the next set Next i Will Next P i Each step of adding to the route set L i A new route set newl is formed, and the route set L in the route set W to be identified is updated with the new route set i Will P i Deleted from C by C.u.NextP i Updating the working procedure set C;
step 2-3: judging whether the process P repeatedly appears in the new route set newl i Or judge the next set Next P i Whether the route set is an empty set or not, if one of the two conditions is satisfied, a route set L corresponding to a route set newl i The marked ending change;
step 2-4: emptying Next P i 、L i Newl;
step 2-5: if the route set W to be identified changes, repeating the steps 2-2 to 2-4; otherwise, the identification is ended.
In this embodiment, the first sequence is added to the procedure set C and the route set W to be identified, as shown in table 3 below;
TABLE 3 variation of C and W after addition of the first order
| W | P 1 ,P 2 ,P 5 |
| C | P 1 ,P 2 ,P 5 |
The first round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 4:
TABLE 4 variation of C and W after first round identification
The second round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 5:
TABLE 5 variation of C and W after second round identification
The third round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 6:
TABLE 6 variation of C and W after the third round of identification
Fourth round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 7:
TABLE 7 variation of C and W after fourth round identification
The fifth round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 8:
TABLE 8 variation of C and W after the fifth round of identification
The sixth round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 9:
TABLE 9 variation of C and W after the sixth round of identification
The seventh round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 10:
table 10 changes in C and W after the seventh round of identification
When a route is subjected to a repeating process, the route is ended and changed, for example, a route circled in the following table. The eighth round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 11:
TABLE 11 variation of C and W after the eighth round of identification
The ninth round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 12:
TABLE 12 variation of C and W after the ninth pass of identification
Tenth round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 13:
TABLE 13 variation of C and W after the tenth round of identification
The eleventh round of recognition, the change conditions of the process set C and the route set W to be recognized are shown in table 14:
table 14 changes in C and W after the eleventh round of identification
When the eleventh round of recognition is finished, all routes of the route set W have been changed to be finished, and thus the traversal is finished, resulting in 6 routes.
Step 3: performing route closing check on the route set W to be identified;
checking whether the repeated procedures appear in the 6 routes, and extracting a circulating line if the repeated procedures appear.
Route 1: p (P) 1 →P 3 →P 6 →P 7 →P 8 →P 10 →P 12 →P 11 →P 9 →P 8
And (3) a circulation line: p (P) 8 →P 10 →P 12 →P 11 →P 9 →P 8
Route 2: p (P) 1 →P 3 →P 6 →P 7 →P 13 →P 12 →P 11 →P 9 →P 8 →P 10 →P 12
And (3) a circulation line: p (P) 12 →P 11 →P 9 →P 8 →P 10 →P 12
Route 3: p (P) 2 →P 4 →P 6 →P 7 →P 8 →P 10 →P 12 →P 11 →P 9 →P 8
And (3) a circulation line: p (P) 8 →P 10 →P 12 →P 11 →P 9 →P 8
Route 4: p (P) 2 →P 4 →P 6 →P 7 →P 13 →P 12 →P 11 →P 9 →P 8 →P 10 →P 12
And (3) a circulation line: p (P) 12 →P 11 →P 9 →P 8 →P 10 →P 12
Route 5: p (P) 5 →P 6 →P 7 →P 8 →P 10 →P 12 →P 11 →P 9 →P 8
And (3) a circulation line: p (P) 8 →P 10 →P 12 →P 11 →P 9 →P 8
Route 6: p (P) 5 →P 6 →P 7 →P 13 →P 12 →P 11 →P 9 →P 8 →P 10 →P 12
And (3) a circulation line: p (P) 12 →P 11 →P 9 →P 8 →P 10 →P 12
The circulation lines including the same process are regarded as the same circulation line.
Step 4: outputting the checking result, and summarizing the circulating line to obtain: p (P) 8 →P 10 →P 12 →P 11 →P 9 →P 8 。
Example 3:
the embodiment of the inventionThe process route structure is schematically shown in FIG. 5, from which the process P can be seen 4 To procedure P 8 With two routes P 4 →P 6 →P 7 →P 8 And P 4 →P 8 The identification process is as follows:
step 1: all procedures P in the process route map 5 i (i=1, 2.,. The term.,. N, N e N) is plotted as a process association table, as shown in table 15 below;
TABLE 15 Process correlation Table for Process routes in FIG. 5
Step 2: after the process association table is imported, all routes in the process routes are identified and stored as a route set W= [ L ] to be identified 1 ,L 2 ,......,L n ],n∈N * ；
Route 1: p (P) 2 →P 4 →P 8 →P 10 →P 12
L 1 ＝[P 2 ,P 4 ,P 8 ,P 10 ,P 12 ]
Route 2: p (P) 2 →P 4 →P 6 →P 7 →P 8 →P 10 →P 12
L 2 ＝[P 2 ,P 4 ,P 6 ,P 7 ,P 8 ,P 10 ,P 12 ]
Route 3: p (P) 2 →P 4 →P 6 →P 7 →P 9 →P 11 →P 12
L 3 ＝[P 2 ,P 4 ,P 6 ,P 7 ,P 9 ,P 11 ,P 12 ]
Route 4: p (P) 1 →P 3 →P 6 →P 7 →P 8 →P 10 →P 12
L 4 ＝[P 1 ,P 3 ,P 6 ,P 7 ,P 8 ,P 10 ,P 12 ]
Route 5: p (P) 1 →P 3 →P 6 →P 7 →P 9 →P 11 →P 12
L 5 ＝[P 1 ,P 3 ,P 6 ,P 7 ,P 9 ,P 11 ,P 12 ]
Route 6: p (P) 1 →P 3 →P 6 →P 7 →P 8 →P 10 →P 12
L 6 ＝[P 5 ,P 6 ,P 7 ,P 8 ,P 10 ,P 12 ]
Route 7: p (P) 5 →P 6 →P 7 →P 9 →P 11 →P 12
L 7 ＝[P 5 ,P 6 ,P 7 ,P 9 ,P 11 ,P 12 ]
Step 3: performing route short circuit inspection on the route set W to be identified;
s3-2-1: selecting two routes L from a set W of routes to be identified i And L j I=1, 2, & gt, n, j=1, 2, & gt, n, i+.j, judgment L i And L j Whether or not there is a child relationship;
the judgment L i And L j The process of whether the sub-genus relationship exists is as follows: when (when)Description of time L i Cause L j Short circuit.
S3-2-2: if L i And L j With sub-genus relationship, calculate L i Complement of (a)The process in complement Z is routed L i A short circuit; otherwiseThe process has no short circuit structure.
The embodiment obtains L through the traversal calculation of the route set 1 Is comprised in L 2 Description L 1 Resulting in L 2 Is further calculated as: l (L) 2 Complement = L 2 -L 1 ＝[P 6 ,P 7 ]Thus for L 1 Cause L 2 P of (2) 6 And P 7 Two processes, "short circuit".
Step 4: outputting the checking result.
If the "short" structure indicates a parallel process, the structure is not abnormal; if the "short" structure indicates an alternate process line segment, then P 6 And P 7 There is no meaning in the process, so the "short-circuited" structure is regarded as abnormal, and therefore, the structure is not absolutely abnormal and is determined according to different scenes and performances.
Claims (6)
1. A method for identifying abnormal process route is characterized in that: the method comprises the following steps:
step 1: all procedures P in the process route i (i=1, 2,) to the N, N e N x) to a process association table;
step 2: after the process association table is imported, all routes in the process routes are identified and stored as a route set W= [ L ] to be identified 1 ,L 2 ,......,L n ],n∈N * ；
Step 2-1: setting a process set C and a route set W to be identified, initializing to be empty, finding out all first sequences in the process according to a process association table, and adding the first sequences into the process set C and the route set W to be identified;
step 2-2: identifying each process P in the process set C i (i=0, 1,) a.m, m e N x) next set NextP i If Next is i Is not empty, find P from the set of routes W to be identified i Route set L for tail order i Traversing the next set Next i Will Next P i Each step of adding to the route set L i A new route set newl is formed, and the route set in the route set W to be identified is updated with the new route setL i Will P i Deleted from C by C.u.NextP i Updating the working procedure set C;
step 2-3: judging whether the process P repeatedly appears in the new route set newl i Or judge the next set Next P i Whether the route set is an empty set or not, if one of the two conditions is satisfied, a route set L corresponding to a route set newl i The marked ending change;
step 2-4: emptying Next P i 、L i Newl;
step 2-5: if the route set W to be identified changes, repeating the steps 2-2 to 2-4; otherwise, finishing the identification;
step 3: performing route disconnection check or route closing check or route short circuit check on the route set W to be identified;
step 4: outputting the checking result.
2. The method for identifying process route anomalies according to claim 1, wherein said route-break check includes the steps of:
s3-1-1: setting an identified association procedure set U and initializing to be empty;
s3-1-2: u performs traversal on W, and updates the identified related procedure set U and the route set W to be identified;
s3-1-3: if U changes and W is not null, repeating S1-2 until W is null, ending the traversal, and no disconnection abnormality exists; if U is unchanged and W is not null, the U and W are in a disconnected relation, the rest routes in W are not associated with U, the traversal is finished, and U and W are output.
3. The method for identifying process route anomalies according to claim 1, wherein the method for route closure checking is: and verifying all routes in the route set W to be identified, and extracting a closed loop route when repeated procedures appear in the routes.
4. The method for identifying process route anomalies according to claim 1, wherein said route short check includes the steps of:
s3-2-1: selecting two routes L from a set W of routes to be identified i And L j I=1, 2, & gt, n, j=1, 2, & gt, n, i+.j, judgment L i And L j Whether or not there is a child relationship;
s3-2-2: if L i And L j With sub-genus relationship, calculate L i Complement of (a)The process in complement Z is routed L i A short circuit; otherwise, the process has no short circuit structure.
5. The method for identifying process route anomalies according to claim 2, wherein: the process of updating the identified related procedure set U and the route set W to be identified in the step 3-1-2 is as follows: each route in W intersects with U, and when the intersection is not empty, the route again merges with U and updates U, deleting the route from W.
6. The method for identifying process route anomalies according to claim 4, wherein: the judgment L i And L j The process of whether the sub-genus relationship exists is as follows: when (when)Description of time L i Cause L j Short circuit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010645639.0A CN111860885B (en) | 2020-07-07 | 2020-07-07 | Method for identifying process route abnormality |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010645639.0A CN111860885B (en) | 2020-07-07 | 2020-07-07 | Method for identifying process route abnormality |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111860885A CN111860885A (en) | 2020-10-30 |
| CN111860885B true CN111860885B (en) | 2024-04-05 |
Family
ID=73152889
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010645639.0A Active CN111860885B (en) | 2020-07-07 | 2020-07-07 | Method for identifying process route abnormality |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111860885B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115600930B (en) * | 2022-11-29 | 2023-03-28 | 天津佰利金电力有限公司 | Intelligent management method for electric power fitting production data |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102027520A (en) * | 2008-06-30 | 2011-04-20 | 通腾科技股份有限公司 | An efficient location referencing method |
| CN102270324A (en) * | 2011-06-18 | 2011-12-07 | 合肥工业大学 | Production control system and control method based on handheld process supervision instruments |
| CN103186690A (en) * | 2011-12-30 | 2013-07-03 | 北京华大九天软件有限公司 | Method for identifying short-circuit path in integrated circuit layout verification process |
| CN106067095A (en) * | 2016-06-16 | 2016-11-02 | 广西电网有限责任公司电力科学研究院 | A kind of recognition methods of the abnormal data of line loss per unit |
| CN106408155A (en) * | 2016-08-25 | 2017-02-15 | 华南理工大学 | Reliability evaluating and preconceived fault set searching method based on related circuit set |
| CN106934484A (en) * | 2016-12-08 | 2017-07-07 | 国网浙江省电力公司 | A kind of live O＆M based on PDA day work planing method |
| CN108256020A (en) * | 2018-01-10 | 2018-07-06 | 百度在线网络技术（北京）有限公司 | Detection method, device, server and the storage medium of abnormal route |
| CN109308571A (en) * | 2018-08-29 | 2019-02-05 | 华北电力科学研究院有限责任公司 | Distribution wire route becomes relationship detection method |
| CN109739193A (en) * | 2019-01-08 | 2019-05-10 | 益模(东莞)智能科技有限公司 | A kind of operating interactive method of process route |
| CN109974725A (en) * | 2017-12-28 | 2019-07-05 | 北京三快在线科技有限公司 | A kind of road network topology construction method, guidance path calculation method and device |
| CN110231543A (en) * | 2019-06-26 | 2019-09-13 | 国网山东省电力公司临沂供电公司 | Power distribution network abnormality recognition method |
| CN110518576A (en) * | 2019-08-05 | 2019-11-29 | 华南理工大学 | Optimization method and system based on circuit matrix identification low-voltage platform area topological structure |
| CN110910359A (en) * | 2019-11-13 | 2020-03-24 | 广东工业大学 | FPC (flexible printed circuit) line detection method based on feature tracking and skeleton feature matching |
-
2020
- 2020-07-07 CN CN202010645639.0A patent/CN111860885B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102027520A (en) * | 2008-06-30 | 2011-04-20 | 通腾科技股份有限公司 | An efficient location referencing method |
| CN102270324A (en) * | 2011-06-18 | 2011-12-07 | 合肥工业大学 | Production control system and control method based on handheld process supervision instruments |
| CN103186690A (en) * | 2011-12-30 | 2013-07-03 | 北京华大九天软件有限公司 | Method for identifying short-circuit path in integrated circuit layout verification process |
| CN106067095A (en) * | 2016-06-16 | 2016-11-02 | 广西电网有限责任公司电力科学研究院 | A kind of recognition methods of the abnormal data of line loss per unit |
| CN106408155A (en) * | 2016-08-25 | 2017-02-15 | 华南理工大学 | Reliability evaluating and preconceived fault set searching method based on related circuit set |
| CN106934484A (en) * | 2016-12-08 | 2017-07-07 | 国网浙江省电力公司 | A kind of live O＆M based on PDA day work planing method |
| CN109974725A (en) * | 2017-12-28 | 2019-07-05 | 北京三快在线科技有限公司 | A kind of road network topology construction method, guidance path calculation method and device |
| CN108256020A (en) * | 2018-01-10 | 2018-07-06 | 百度在线网络技术（北京）有限公司 | Detection method, device, server and the storage medium of abnormal route |
| CN109308571A (en) * | 2018-08-29 | 2019-02-05 | 华北电力科学研究院有限责任公司 | Distribution wire route becomes relationship detection method |
| CN109739193A (en) * | 2019-01-08 | 2019-05-10 | 益模(东莞)智能科技有限公司 | A kind of operating interactive method of process route |
| CN110231543A (en) * | 2019-06-26 | 2019-09-13 | 国网山东省电力公司临沂供电公司 | Power distribution network abnormality recognition method |
| CN110518576A (en) * | 2019-08-05 | 2019-11-29 | 华南理工大学 | Optimization method and system based on circuit matrix identification low-voltage platform area topological structure |
| CN110910359A (en) * | 2019-11-13 | 2020-03-24 | 广东工业大学 | FPC (flexible printed circuit) line detection method based on feature tracking and skeleton feature matching |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111860885A (en) | 2020-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113408853B (en) | Neutral BOM construction method and system based on engineering and manufacturing bill of materials | |
| CN104881759A (en) | Business fallback integrated system based on workflow and realization method thereof | |
| Sheen et al. | Block assembly planning in shipbuilding using case-based reasoning | |
| CN111860885B (en) | Method for identifying process route abnormality | |
| US7079677B2 (en) | Automatic intelligent yield improving and process parameter multivariate system and the analysis method thereof | |
| CN112712441B (en) | Automatic carding method for topological relation of urban' network river | |
| CN108228409A (en) | A kind of algorithm performs based on signal stream are sequentially generated method | |
| CN110209118A (en) | With the robustness control method based on Petri network for using multiple types multi-quantity resource and flexible path feature | |
| CN116610896A (en) | Manufacturing service supply and demand matching method based on subgraph isomorphism | |
| CN110781311A (en) | Enterprise consistent action calculation system and method | |
| CN115511233A (en) | Supply chain process reproduction method and system based on process mining | |
| CN103793589B (en) | High-speed train fault handling method | |
| CN105095060A (en) | Device and method for generating test case by using rule set network | |
| CN106056300A (en) | Crisscrossed mixed resource allocation rule mining method | |
| CN116050638B (en) | Automatic manufacturing system initial resource optimal configuration method based on tag time Petri net | |
| CN108009942B (en) | Topological structure connectivity checking and correcting method in water supply network hydraulic model building process | |
| CN104008461A (en) | Workflow processing method and system | |
| CN116311007A (en) | Node space analysis-based identification method and binding quality evaluation method for missed binding reinforcement nodes | |
| CN105718591A (en) | Qualitative spatial relation reasoning method based on rules and constraint satisfaction | |
| CN114462894A (en) | Data analysis-based e-commerce order material replacement assistant decision method | |
| CN113704935A (en) | Cable channel attribute and incidence relation extraction method considering three-dimensional modeling randomness | |
| CN109685453B (en) | Method for intelligently identifying effective paths of workflow | |
| CN112306015A (en) | Bayesian network-based machine tool equipment resource optimization decision method in cloud manufacturing environment | |
| Sąsiadek | Assembly sequence planning with the principles of design for assembly | |
| Zemni et al. | Business process fragments behavioral merge |
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 |