CN111339597A - Double-code network rapid automatic layout method suitable for information engineering construction project - Google Patents
Double-code network rapid automatic layout method suitable for information engineering construction project Download PDFInfo
- Publication number
- CN111339597A CN111339597A CN202010130763.3A CN202010130763A CN111339597A CN 111339597 A CN111339597 A CN 111339597A CN 202010130763 A CN202010130763 A CN 202010130763A CN 111339597 A CN111339597 A CN 111339597A
- Authority
- CN
- China
- Prior art keywords
- double
- work
- code network
- working
- code
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a quick and automatic layout method of a double-code network suitable for an information engineering construction project, which comprises the following steps of: making a task responsibility division table; performing matrixing on the task responsibility division work table to form a working matrix before the task responsibility division work table containing the duration and a working matrix after the task responsibility division work table containing the duration; finding out a key line and key work, and calculating the total construction period; drawing a main part of the double-code network diagram; supplementing other parts of the double-code network graph; optimizing the line layout of the double-code network graph; checking a logical relation; numbering nodes of the double-code network graph based on the immediately preceding working matrix; calculating and labeling time parameters of each work in the double-code network diagram; and marking key lines, key work and total construction period. The invention realizes the rapid conversion from the work responsibility division table to the double-code network diagram, can generate the programmable double-code network diagram, and is suitable for the planning, the design and the construction of projects containing flow construction, such as information engineering construction projects.
Description
Technical Field
The invention relates to the technical field of information engineering construction and network layout, in particular to a quick automatic layout method of a double-code network suitable for information engineering construction projects.
Background
The double-code network graph is also called an arrow line graph, namely the network graph which represents activities by using arrow lines and connects the activities at nodes to represent the dependency relationship between works. The logical relationships between activities are represented by end-to-start relationships only and by dashed work lines. Because the arrow lines are used to represent activities, sometimes to determine all logical relationships, the dashed arrow lines can be used to represent virtual jobs, and perform three functions of linking, distinguishing, and breaking. The double-code network diagram is one of important tools for progress planning, and can very clearly express the logical relationship between each process in a project as large as one project and a project as small as one project. The double-code network diagram has wide application value in the aspects of construction project construction, product development, operation management, production organization and daily life. The double-code network graph is used for progress planning, the logical relation among all the procedures is coordinated and restricted, and quantitative analysis and optimization adjustment of the progress plan are facilitated.
Traditionally, most software for automatically drawing network planning drawings only can draw single-code network drawings and Gantt drawings, but when the actual construction project progress plan is carried out, the double-code network drawings are needed to be used most of the time. Therefore, in general, in order to obtain a double-code network diagram, on the basis of obtaining a complete process logic relationship, drawing is performed manually, a sketch is drawn first, and then manual gradual adjustment is performed, so that the process is very tedious, time-consuming and labor-consuming, and the implementation progress of a construction project is slowed to a certain extent.
Moreover, some current drawing techniques and methods of the double-code network diagram are more suitable for scenes with simple logic relation between the traditional sequential construction or parallel construction and other processes. For information engineering construction projects, due to the fact that a large number of methods for flow construction are used, a plurality of flow sections exist, such as machine rooms, relay sections, base stations, cells and the like, all professional construction operation groups carry out sequential construction on all the flow sections according to a certain construction sequence, all procedures among the flow sections are complex in logical relation, parallel relation exists and sequential relation exists, the drawing skill and method of a series of currently used double-code network diagrams are not suitable, and in order to draw qualified double-code network diagrams, logic deduction and graph line optimization adjustment are often needed to be carried out manually with a large amount of effort.
Disclosure of Invention
The invention aims at the technical problems that the information engineering construction needs a large amount of application flow construction, a plurality of flow sections exist, so that the process of drawing the double-code network diagram is very complicated, time and labor are consumed, and the implementation progress of the construction engineering project is slowed down; the method realizes the quick conversion from the work responsibility division table to the double-code network diagram, can generate the programmable double-code network diagram, and is suitable for the planning, the design and the construction of projects containing flow construction, such as information engineering construction projects.
In order to achieve the aim, the method for quickly and automatically laying out the double-code network suitable for the information engineering construction project is provided, and comprises the following steps of:
(1) making a task responsibility division table;
(2) matrixing the task responsibility division worksheet, and forming an immediately preceding working matrix containing the duration and an immediately following working matrix containing the duration according to a logic relationship deduction method; the working matrix before the emergency can obtain the working relation before the emergency through exploring the positions of the non-zero elements in the matrix row by row or column by column; the working matrix after tightening can obtain the working relation after tightening by exploring the positions of the non-zero elements in the matrix row by row or column by column;
(3) based on the working matrix before the emergency, finding out a key line and key work forming the key line by using a traversal method, and calculating the total construction period;
(4) drawing a main part of a double-code network diagram consisting of key lines and key works;
(5) supplementing other parts of the double-code network diagram based on the immediately preceding working matrix;
(6) redundant loops and virtual work are eliminated, so that the graph line arrangement of the double-code network diagram is optimized;
(7) utilizing the working matrix after the next generation to carry out logical relationship check on the double-code network diagram which is formed and optimized based on the working matrix before the next generation;
(8) after the logical relationship check in the step (7) is correct, numbering nodes of the double-code network graph based on the immediately preceding working matrix;
(9) calculating and labeling time parameters of each work in the double-code network diagram;
(10) and marking key lines, key work and total construction period at proper positions of the double-code network diagram.
In particular, the task responsibility division table comprises fields and records; the fields comprise the work name, the work code number, the duration and the implementation object of the work item, and the records are values corresponding to the fields.
In particular, the implementation object is an implementation team or an implementation personnel.
In particular, the time parameters include an earliest start time, an earliest completion time, a latest start time, a latest completion time, a total time difference, and a free time difference.
Particularly, the logic relationship deduction method is to combine and deduct a logic relationship before and after the processing according to the process logic relationship, the organization logic relationship and the priority logic relationship, and combine the working duration to generate a working matrix before the processing including the duration and a working matrix after the processing including the duration;
the process logic relationship is a limit relationship obtained according to a domain knowledge database; the organization logic relationship is a restriction relationship obtained according to a rule that an implementation object can only do one work at the same time, and can only do another conflict work after the work is completed, and all conflict works are completed in sequence; the priority logic relationship is an obtained restriction relationship obtained according to the rule of each flow segment specified manually.
And comparing the domain knowledge database according to the work names of the work responsibility division tables to obtain the process logic relationship of each work, and giving the process logic relationship in a limiting relationship form. If the work A is 'single-disc inspection', the work B is 'optical cable disc matching', the optical cable disc matching can be carried out only after the single-disc inspection is carried out according to the domain knowledge database, and therefore the restriction relation is marked as 'A → B' when the work A is carried out before the work B.
According to the information of the implementation team or the implementation personnel of the work responsibility division table, the organization logic relationship of each work can be obtained and is given in a limited relationship mode, namely, the same team or the implementation personnel can only do one work at the same time, the other conflict work can not be done until the completion of the work, and all the conflict works are completed in sequence. For example, the first construction team is responsible for both the work items a and B according to the work responsibility division work schedule requirements, the first construction team can only operate one of A, B work items at the same time and complete the two work items in turn, and the restriction relationship is marked as "a | B".
For sequential operation or parallel operation projects, based on the process logic relationship and the organization logic relationship, the logic relationship is generally complete, and a complete working matrix immediately before and after can be formed. However, for information engineering construction projects which usually include the flow segments by using the flow process method, the priority logic relationship of each flow segment needs to be manually specified and given in the form of a restricted relationship. Assuming that there are flow segments I (including work D, E, F and D → E → F), ii (including work G, H, I and G → H → I), iii (including work J, K, L and J → K → L), assuming that the priority of the flow segment I is highest, the flow segment ii is next to the flow segment iii is the lowest, the operation of the flow segment I should be preferentially performed, then the operation of the flow segment ii is performed, and then the operation of the flow segment iii is performed, the restriction relationship is marked as "I (D → E → F) > ii (G → H → I) > iii (J → K → L)".
The invention forms complete logic relation between all the works according to the three of the process logic relation, the organization logic relation and the priority logic relation, and the logic relation between the works and the immediately preceding and the immediately following, namely, if the work A is the immediately preceding work of the work B, the work A is expressed as the work B
Accordingly, if job B is the immediate post job of job A, then the equivalence can be expressed as
By deducing the information about the work duration in the immediate before and after logical relationship and work responsibility division table of the performance, the computer can generate an immediate before work matrix containing the duration and an immediate after work matrix containing the duration:
wherein t represents the total number of work items; when j ≠ k, ajk0 means that the j-th job is not an immediately preceding job of the k-th job, ajkNot equal to 0 indicates that the j-th job is an immediately preceding job of the k-th job, and ajkIs equal to the duration of the j-th job, in particular, when j equals k, we set ajk0. Similarly, when j ≠ k, b jk0 means that the j-th job is not an immediate job of the k-th job, bjkNot equal to 0 indicates that the j-th job is an immediately subsequent job to the k-th job, and bjkIs equal to the duration of the j-th job, in particular, when j equals k, we set bjk＝0。
Particularly, the traversal method is to search an immediately previous working matrix according to rows and find all zero rows; and traversing a column of a certain all-zero row, searching the columns corresponding to the immediately preceding work one by one after the immediately preceding work of the column is found, repeating iteration until no additional immediately preceding work can be found, and recording work numbers, wherein the work numbers are subscripts of all elements in the traversal process.
I.e. we search the immediately preceding working matrix with duration by row, finding all the all zero rows. Suppose that the number of a row of all zeros is j0Then there is
Then j of the working matrix immediately before is searched0Column, find all j0And (4) performing the work immediately before the work, then inquiring the columns corresponding to the work immediately before one by one, and repeating iteration until no additional work immediately before can be found, namely reaching all zero columns.
In particular, the key line is a working line with the largest sum of the duration of all working lines; the working lines are connected together by working numbers; the total construction period is the maximum sum of the duration time, and the duration time of the work corresponding to the last all-zero row of the working line.
Based on the immediate preceding working matrix, the specific method for supplementing other parts of the double-code network diagram comprises the following steps: and further supplementing the logic connection relation among all the works in the double-code network diagram on the basis of the key lines according to the standard drawing rule one by one and by combining a bridging method and a pointing method, and introducing virtual works if necessary until the verification and the supplementation of all the work lines are completed. In principle, the columns corresponding to the critical jobs in the immediately preceding job matrix containing the duration are first searched for pattern completion. Then, the columns corresponding to the newly appeared non-key work are searched one by one, and the graph line is completed until all the columns are traversed and the logic relations among all the works are completed.
Specifically, the method for eliminating redundant loops and virtual work is to find that a certain node in the double-code network only has one introduced arrow line and one drawn arrow line, and only one arrow line is a virtual arrow line, eliminate the node and the corresponding virtual arrow line, and directly extend the real arrow line to the eliminated node and the node corresponding to the virtual arrow line in the forward direction or the backward direction.
Particularly, the method for checking the logical relationship in the step (7) adopts a checking mechanism, wherein the checking mechanism is to compare the working matrix after tight with the working matrix after tight generated based on the double-code network diagram in the step (6); if the two are the same, the network map with double code numbers is correct.
The checking mechanism can check whether the double-code network graph is complete and correctly reflects the logic relation among various works. Because the method for generating the double-code network is formed based on the information provided by the working matrix before the working matrix, and because the absolute logic consistency exists between the working matrix before the working matrix and the working matrix after the working matrix (namely, the working A is the working before the working B, and the working B must be the working after the working A), all working routes connecting the initial node to the terminal node can be traversed from the optimized double-code network graph, the logical relationship after each working is obtained, and another working matrix after the working matrix based on the optimized double-code network graph is generated:
therefore, whether the optimized double-code network diagram completely and correctly reflects the logic relation among various works can be known only by checking whether C is equal to B. If C is equal to B, it is stated that the optimized dual-code network graph is correct, and node numbering of the dual-code network graph can be performed based on an immediately preceding working matrix containing duration, otherwise, manual inspection, intervention and control need to be introduced, and the initial logical relationship input stage is returned to.
The specific method for numbering the nodes of the double-code network graph based on the immediately preceding working matrix comprises the following steps: assuming that there are a total of θ nodes in the generated double-code network diagram, the computer can realize effective numbering of all the θ nodes through a series of programming steps. Specifically, the end node number is θ, the start node number is 1, and if λ arrow lines are provided to point to the end node, the start nodes of the arrow lines pointing to the end node are numbered θ -1 and θ -2 … θ - λ. For each initial node, in addition to the initial node, it is also the terminal node of another arrow line immediately before, and for the initial node of the one arrow line immediately before, its number depends on the minimum value of the numbers of the terminal nodes of all the arrow lines minus 1. According to the method, the network node can be repeatedly pushed backwards to the starting node, and the basic principle of the node numbering of the double-code network graph is met: 1) the whole double-code network graph has a unique starting node and an unique ending node; 2) for all the arrow lines, the serial number of the terminal node is greater than that of the initial node; 3) all numbers are not repeated; 4) the maximum number does not exceed the total number of nodes.
After numbering, for each item of work represented by an arrow line in the double-code network diagram, time parameters including six items of earliest starting time, earliest finishing time, latest starting time, latest finishing time, total time difference and free time difference are calculated according to a standard method and are marked in the double-code network diagram.
Finally, according to the foregoing traversal method, two important pieces of information, namely, the critical lines, the critical work, and the total construction period, are obtained, so that the double-code network diagram can be drawn only by making labels at appropriate positions of the double-code network diagram.
The computer program based on the method can rapidly output the double-code network graph with correct logic relation and labeled related parameters.
The invention has the beneficial effects that:
1. the invention provides a clear information format through the work responsibility division work table, the work responsibility division work table can be used as an input information item of a program, the logic relation between work items is limited, and if the work responsibility division work table is used for sequential operation or parallel operation, the work responsibility division work table can provide a complete logic relation; if pipelining is involved, it is also necessary to manually specify the order of priority between the segments of the pipeline.
2. The invention provides a complete set of logic relations among the working items, the logical relations before and after the working items are deduced by combining the process logic relations, the organization logic relations and the priority logic relations, and the expression forms of the restriction relations of the three logic relations are provided and the working duration is combined. The method is suitable for the condition that a plurality of running water sections exist in the process of applying running water construction in a large amount in information engineering construction.
3. The invention comprises the following steps: making a task responsibility division table; performing matrixing on the task responsibility division work table to form a working matrix before the task responsibility division work table containing the duration and a working matrix after the task responsibility division work table containing the duration; finding out a key line and key work, and calculating the total construction period; drawing a main part of the double-code network diagram; supplementing other parts of the double-code network graph; optimizing the line layout of the double-code network graph; checking a logical relation; numbering nodes of the double-code network graph based on the immediately preceding working matrix; calculating and labeling time parameters of each work in the double-code network diagram; and marking key lines, key work and total construction period. The steps can be applied to a computer program, the rapid conversion from the work responsibility division table to the double-code network diagram is realized, and the generation of the programmable double-code network diagram is suitable for project planning, design and construction including flow construction, such as information engineering construction projects.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a software implementation of an embodiment of the present invention;
FIG. 2 is a diagram of a dual-code network of an initial backbone portion according to an embodiment of the present invention;
FIG. 3 is a diagram of a dual-code network of a backbone portion augmented by query critical work in accordance with an embodiment of the present invention;
FIG. 4 is a diagram of a dual-code network of a trunk portion after two non-critical jobs are supplemented with query H, I in accordance with an embodiment of the present invention;
FIG. 5 is a diagram of a dual-code network of a trunk portion after two non-critical jobs have been supplemented with query E, F in accordance with an embodiment of the present invention;
FIG. 6 is a diagram of a dual-code network of a backbone portion after querying for B non-critical jobs to supplement in accordance with an embodiment of the present invention;
FIG. 7 is a diagram of a double-code network after optimized configuration according to an embodiment of the present invention;
fig. 8 is a network diagram with dual code numbers 1 and 14 after node numbers are set according to the embodiment of the present invention;
fig. 9 is a network diagram of a dual-code network after the node number is set to 13 according to the embodiment of the present invention;
fig. 10 is a network diagram of a dual-code network after setting a node number 12 according to an embodiment of the present invention;
fig. 11 is a network diagram of a dual-code network after node numbers 10 and 11 are set according to the embodiment of the present invention;
fig. 12 is a network diagram of a dual-code network after setting a node number of 9 according to the embodiment of the present invention;
fig. 13 is a network diagram of a dual-code network after setting a node number of 8 according to an embodiment of the present invention;
fig. 14 is a network diagram with dual code numbers of nodes 7 and 6 according to the embodiment of the present invention;
fig. 15 is a network diagram of a dual-code network after setting a node number of 5 according to the embodiment of the present invention;
fig. 16 is a network diagram with dual code numbers after node numbers 3 and 4 are set according to the embodiment of the present invention;
fig. 17 is a final network diagram with two codes after setting node number 2 according to the embodiment of the present invention;
Detailed Description
The preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings so that the advantages and features of the present invention can be more easily understood by those skilled in the art, and the scope of the present invention will be more clearly and clearly defined.
Referring to fig. 1, a software implementation flowchart of a double-code network rapid automatic layout method suitable for an information engineering construction project according to this embodiment is shown, and the application and specific process of the present invention are described with a simple example of an information engineering construction project and an overhead line construction task of some three relay segments (water flow segments). The work responsibility division table information is as follows:
| work code | Name of work | Duration (sky) | Construction team | |
| A | Single- |
3 | First of all | |
| B | Optical |
2 | First of all | |
| | Routing retest | 12 | Second step | |
| D | i flow section |
6 | Second step | |
| E | i-flow section optical cable laying | 4 | C3 | |
| F | i-flow section |
2 | First of all | |
| G | ii construction of flow |
8 | Second step | |
| H | ii laying of optical cable in flowing |
5 | C3 | |
| I | ii flow water section |
3 | First of all | |
| J | iii rod construction of |
7 | Second step | |
| K | iii flow section optical cable laying | 4 | C3 | |
| L | iii flow line segment |
2 | First of all | |
| M | |
2 | First of all |
Firstly, comparing the domain knowledge database to obtain the process logic relation of each work. According to basic overhead line construction process requirements and relevant laws and regulations, firstly, optical cable distribution can be carried out only on the basis of qualified single-tray detection and error-free routing retest, so that the optical cable distribution is given in a limiting relationship of A → B, C → B;
secondly, the construction of the pole road can be carried out only on the basis of the routing retest without errors, so that the construction is given in a form of a restricted relationship, namely C → D, C → G, C → J;
secondly, the optical cable laying work can be carried out only after the optical cable distribution is finished and the pole line construction is finished, so that B → E, D → E, B → H, G → H, B → K, J → K;
then, the optical cable splicing work can be performed only after the optical cable is laid, so there are E → F, H → I, K → L;
finally, the hop test of the full route can be performed only after the completion of all the hop connection work, so there are F → M, I → M, L → M;
all the above constraint relationships constitute the process logic relationship of the project.
Besides the process logic relationship, because the construction team only comprises a first part, a second part and a third part, the work responsibility division table is limited to the organization logic relationship at the same time, and the following results are easy to know:
A|B|F|I|L|M、C|D|G|J、E|H|K；
since there are three flow segments, we do not consider defining the logical relationship of precedence as I (D → E → F) > ii (G → H → I) > iii (J → K → L), without loss of generality;
by integrating the logical relationship and the duration information in the work responsibility division table, an immediately preceding work matrix containing the duration and an immediately following work matrix containing the duration can be obtained:
from the immediately preceding working matrix a with duration, we can find the 13 th row of all-zero behavior, corresponding to work M. All working lines can be obtained by traversal. The work M corresponding to all zero rows in the column only has the 12 th row, corresponding to the work L. An incomplete working line L-M can be formed. Then, the 12 th column is inquired, and the work I and the work K are found to be the work immediately before the work L, namely two incomplete work lines, namely-I-L-M and-K-L-M, are obtained, and a first double branch is formed.
Aiming at the first fork-I-L-M, searching the 9 th column corresponding to the I, finding that work F and work H are the work immediately before the work I, namely obtaining two incomplete work lines, -F-I-L-M and-H-I-L-M, forming a second fork, and continuing to reverse and search in the same way, finally obtaining the following complete work lines:
A-B-E-F-I-L-M (duration of route: 18 days);
C-B-E-F-I-L-M (duration of route: 27 days);
C-D-E-F-I-L-M (duration of route: 31 days);
A-B-E-H-I-L-M (duration of route: 21 days);
C-B-E-H-I-L-M (route duration: 30 days);
C-D-E-H-I-L-M (duration of route: 34 days);
C-D-G-H-I-L-M (duration of route: 38 days);
and aiming at the second bifurcation-K-L-M, searching the 11 th column corresponding to K, and obtaining the following complete working line in the same way:
A-B-E-H-K-L-M (duration of route: 22 days);
C-B-E-H-K-L-M (duration of route: 31 days);
C-D-E-H-K-L-M (duration of route: 35 days);
C-D-G-H-K-L-M (duration of route: 39 days);
C-D-G-J-K-L-M (duration of route: 41 days);
the total number of 12 working lines. And the comparison of the total duration shows that the key line with the longest duration of the route is C-D-G-J-K-L-M, which is composed of the key jobs C, D, G, J, K, L, M, and the total construction period is the duration of the route, i.e. 41 days. Accordingly, the main part of the network diagram with double code numbers can be drawn, as shown in fig. 2.
Next, the column of the work M, L, K, J, G, D, C corresponding to the immediately preceding work matrix containing the duration is successively queried, and the corresponding immediately preceding work logical relationship is supplemented, so as to obtain the main part of the supplemented double-code network diagram, as shown in fig. 3.
Aiming at H, I new non-critical works in the incomplete network diagram, inquiring corresponding columns in the immediately preceding working moment containing duration, and supplementing corresponding immediately preceding working logic relations to obtain a supplemented double-code network diagram, as shown in fig. 4.
Aiming at E, F new non-critical works in the incomplete network diagram, inquiring corresponding columns in the immediately preceding working moment containing duration, and supplementing corresponding immediately preceding working logic relations to obtain a supplemented double-code network diagram, as shown in fig. 5.
Aiming at a non-critical work B which newly appears in an incomplete network diagram, a corresponding column in a working moment before the work B and containing duration is inquired, a corresponding logical relation of the working moment before the work B is supplemented, and because the columns corresponding to A, C which work before the work B and are all zero columns, the logical relation is complete so far, and a double-code network diagram which has a complete logical relation after the supplement and is not optimized is obtained, as shown in fig. 6.
According to the present invention, all the virtual arrow lines are checked one by one, the redundant virtual arrow lines are eliminated, and the graph lines are rearranged to obtain the optimized double-code network graph, as shown in fig. 7.
And (3) checking the working matrix after the network diagram is closed, wherein the working matrix comprises duration, and the working matrix after the network diagram is optimized is obtained as follows:
because C is equal to B, the logical relationship between the works expressed by the optimized double-code network diagram drawn according to the immediately-before work matrix a containing the duration is correct.
It is easy to know that the current dual-code network graph contains 14 nodes, so the end node number is 14, and the start node number is 1, and the dual-code network graph shown in fig. 8 is obtained.
Since only one node points to node 14, the node is numbered 14-1-13, so there is a dual-code network graph as shown in fig. 9.
Similarly, since only one node points to node 13, the node is numbered 13-1-12, so that there is a network diagram with double codes as shown in fig. 10.
At this time, since there are two nodes pointing to the node 12, the numbers thereof are 12-1-11 and 12-2-10, respectively. Without loss of generality, the node number of the trunk portion is 11, and the node number of the branch portion is 10, so that a double-code network diagram as shown in fig. 11 is provided.
Note that, at this time, a node points to the node 10 and the node 11 by two dotted arrows, so the node number should be the minimum value of 10 and 11 minus 1, i.e., min {10,11} -1 ═ 9, so there is a double-symbol network diagram as shown in fig. 12.
The node pointing to node 9 can therefore be determined to be numbered 9-1-8, so there is a dual-code network graph as shown in fig. 13.
From the above figure, the node numbers pointing to the node 8 and the node 11 at the same time and the node numbers pointing to the node 8 and the node 10 at the same time can be determined as min {8,11} -1 ═ 7 and min {8,10} -1 ═ 7, but since the number 7 can be used only 1 time and cannot be reused, we can let the node number of the trunk portion be 7 and the node number of the branch portion be 7-1 ═ 6 without loss of generality, so there is a double-code network diagram as shown in fig. 14.
As shown in fig. 14, the node number pointing to the node 6 may also be determined to be 6-1-5, so that there is a dual-code network diagram as shown in fig. 15.
Nodes pointing to both node 5 and node 7 can therefore be determined as min {5,7} -1 ═ 4, and nodes pointing to node 5 alone can also be determined as 5-1 ═ 4, and again, without loss of generality, we let the node number of the trunk portion be 4 and the node number of the branch portion be 4-1 ═ 3, so there is a double-code network graph as shown in fig. 16.
The last unnumbered node pointing to nodes 3 and 4 is numbered min {3,4} -1 ═ 2, and the final double-code network map with the full number is the double-code network map shown in fig. 17.
Although the embodiments of the present invention have been described with reference to the accompanying drawings, various changes or modifications may be made by the patentees within the scope of the appended claims, and within the scope of the invention, as long as they do not exceed the scope of the invention described in the claims.
Claims (9)
1. A double-code network rapid automatic layout method suitable for information engineering construction projects comprises the following steps:
(1) making a task responsibility division table;
(2) matrixing the task responsibility division worksheet, and forming an immediately preceding working matrix containing the duration and an immediately following working matrix containing the duration according to a logic relationship deduction method; the working matrix before the emergency can obtain the working relation before the emergency through exploring the positions of the non-zero elements in the matrix row by row or column by column; the working matrix after tightening can obtain the working relation after tightening by exploring the positions of the non-zero elements in the matrix row by row or column by column;
(3) based on the working matrix before the emergency, finding out a key line and key work forming the key line by using a traversal method, and calculating the total construction period;
(4) drawing a main part of a double-code network diagram consisting of key lines and key works;
(5) supplementing other parts of the double-code network diagram based on the immediately preceding working matrix;
(6) redundant loops and virtual work are eliminated, so that the graph line arrangement of the double-code network diagram is optimized;
(7) utilizing the working matrix after the next generation to carry out logical relationship check on the double-code network diagram which is formed and optimized based on the working matrix before the next generation;
(8) after the logical relationship check in the step (7) is correct, numbering nodes of the double-code network graph based on the immediately preceding working matrix;
(9) calculating and labeling time parameters of each work in the double-code network diagram;
(10) and marking key lines, key work and total construction period at proper positions of the double-code network diagram.
2. The method for rapid and automatic layout of the double-code network suitable for the information engineering construction project according to claim 1, wherein: the task responsibility division table comprises fields and records; the fields comprise the work name, the work code number, the duration and the implementation object of the work item, and the records are values corresponding to the fields.
3. The method for rapid and automatic layout of the double-code network suitable for the information engineering construction project according to claim 1, wherein: the implementation object is an implementation team or an implementation personnel.
4. The method for rapid and automatic layout of the double-code network suitable for the information engineering construction project according to claim 1, wherein: the time parameters comprise the earliest starting time, the earliest finishing time, the latest starting time, the latest finishing time, the total time difference and the free time difference.
5. The method for rapid and automatic layout of the double-code network suitable for the information engineering construction project according to claim 1, wherein: the logic relationship deduction method is that a pre-close logic relationship and a post-close logic relationship are deduced according to the combination of a process logic relationship, an organization logic relationship and a priority logic relationship, and a pre-close work matrix containing duration and a post-close work matrix containing duration are generated according to the combination of work duration;
the process logic relationship is a limit relationship obtained according to a domain knowledge database; the organization logic relationship is a restriction relationship obtained according to a rule that an implementation object can only do one work at the same time, and can only do another conflict work after the work is completed, and all conflict works are completed in sequence; the priority logic relationship is an obtained restriction relationship obtained according to the rule of each flow segment specified manually.
6. The method for rapid and automatic layout of the double-code network suitable for the information engineering construction project according to claim 1, wherein: the traversal method is to search an immediately previous working matrix according to rows and find all zero rows; and traversing a column of a certain all-zero row, searching the columns corresponding to the immediately preceding work one by one after the immediately preceding work of the column is found, repeating iteration until no additional immediately preceding work can be found, and recording work numbers, wherein the work numbers are subscripts of all elements in the traversal process.
7. The method for rapid and automatic layout of the double-code network suitable for the information engineering construction project according to claim 1, wherein: the key line is a working line with the maximum sum of the duration time of all working lines; the working lines are connected together by working numbers; the total construction period is the maximum sum of the duration time, and the duration time of the work corresponding to the last all-zero row of the working line.
8. The method for rapid and automatic layout of the double-code network suitable for the information engineering construction project according to claim 1, wherein: the method for eliminating redundant loops and virtual work is to find that one node in the double-code network only has one introduced arrow line and one led-out arrow line, and only one arrow line is a virtual arrow line, eliminate the node and the corresponding virtual arrow line, and directly extend the real arrow line to the eliminated node and the node corresponding to the virtual arrow line in the forward direction or the backward direction.
9. The method for rapid and automatic layout of the double-code network suitable for the information engineering construction project according to claim 1, wherein: the method for checking the logical relationship in the step (7) adopts a checking mechanism, wherein the checking mechanism is used for comparing the working matrix after tightening with the working matrix after tightening generated on the basis of the double-code network diagram in the step (6); if the two are the same, the network map with double code numbers is correct.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010130763.3A CN111339597B (en) | 2020-02-28 | 2020-02-28 | Double-code network rapid automatic layout method suitable for information engineering construction project |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010130763.3A CN111339597B (en) | 2020-02-28 | 2020-02-28 | Double-code network rapid automatic layout method suitable for information engineering construction project |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111339597A true CN111339597A (en) | 2020-06-26 |
| CN111339597B CN111339597B (en) | 2023-03-31 |
Family
ID=71184667
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010130763.3A Active CN111339597B (en) | 2020-02-28 | 2020-02-28 | Double-code network rapid automatic layout method suitable for information engineering construction project |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111339597B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111814438A (en) * | 2020-07-08 | 2020-10-23 | 中国人民解放军战略支援部队航天工程大学 | System and method for drawing network diagram |
| CN112150011A (en) * | 2020-09-25 | 2020-12-29 | 杨军 | Dynamic critical path analysis method and device and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| RU2147638C1 (en) * | 1998-09-16 | 2000-04-20 | Туровский Илья Яковлевич | Double-chord arrow-graph for trueing of railway track by calculation |
| CN101145222A (en) * | 2007-07-31 | 2008-03-19 | 周远成 | Direct generation for double symbol network chart subsystem using work part list |
| CN104820872A (en) * | 2015-05-06 | 2015-08-05 | 华北电力大学 | Method for optimizing project duration of engineering project based on potential anti-key working procedures |
| CN106408171A (en) * | 2016-08-31 | 2017-02-15 | 中国人民解放军海军航空工程学院青岛校区 | Heuristic activity-on-arrow diagram automatic drawing method |
-
2020
- 2020-02-28 CN CN202010130763.3A patent/CN111339597B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| RU2147638C1 (en) * | 1998-09-16 | 2000-04-20 | Туровский Илья Яковлевич | Double-chord arrow-graph for trueing of railway track by calculation |
| CN101145222A (en) * | 2007-07-31 | 2008-03-19 | 周远成 | Direct generation for double symbol network chart subsystem using work part list |
| CN104820872A (en) * | 2015-05-06 | 2015-08-05 | 华北电力大学 | Method for optimizing project duration of engineering project based on potential anti-key working procedures |
| CN106408171A (en) * | 2016-08-31 | 2017-02-15 | 中国人民解放军海军航空工程学院青岛校区 | Heuristic activity-on-arrow diagram automatic drawing method |
Non-Patent Citations (2)
| Title |
|---|
| 姜静: "青岛火车站信息机房工程项目进展管理研究", 《信息科技辑》 * |
| 魏宏博: "一种求双代号网络关键线路的简便矩阵算法", 《计算机工程与技术》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111814438A (en) * | 2020-07-08 | 2020-10-23 | 中国人民解放军战略支援部队航天工程大学 | System and method for drawing network diagram |
| CN112150011A (en) * | 2020-09-25 | 2020-12-29 | 杨军 | Dynamic critical path analysis method and device and electronic equipment |
| CN112150011B (en) * | 2020-09-25 | 2024-01-26 | 杨军 | Dynamic critical path analysis method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111339597B (en) | 2023-03-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101706803B (en) | Method for migrating production data of weaving workshop | |
| CN111339597B (en) | Double-code network rapid automatic layout method suitable for information engineering construction project | |
| CN104965735A (en) | Apparatus for generating upgrade SQL script | |
| CN105683940A (en) | Processing a data flow graph of a hybrid flow | |
| CN113064586B (en) | Code completion method based on abstract syntax tree augmented graph model | |
| CN103473171A (en) | Coverage rate dynamic tracking method and device based on function call paths | |
| CN111127068B (en) | Automatic pricing method and device for engineering quantity list | |
| JPH07200358A (en) | Automatic test method of software application | |
| CN108228187B (en) | Global optimization method of numerical program | |
| CN107067200B (en) | Operation method and device for bill of material data | |
| CN115545577B (en) | Method and equipment for processing scheduling data | |
| CN107239468A (en) | Task node management method and device | |
| US5742827A (en) | Method of automatically forming program specifications and apparatus therefor | |
| CN116244333A (en) | Database query performance prediction method and system based on cost factor calibration | |
| CN108874395A (en) | Hard Compilation Method and device during a kind of modularization stream process | |
| US20080046863A1 (en) | Method of re-using software attributes in graphical programs | |
| CN112256637A (en) | File management method and device based on abstract syntax tree and storage medium | |
| US20090064092A1 (en) | Visual programming language optimization | |
| CN113298293B (en) | Natural gas pipe network conveying path matching method | |
| CN109325269A (en) | A kind of and associated inspection planning and designing method of three-dimensional digital assembly technology | |
| CN113157551B (en) | ROS-oriented differential fuzzy test method | |
| CN114115843A (en) | Low code production method of index data and visualized data processing system thereof | |
| CN114489679A (en) | Intelligent analysis system and method for DAG dependency of hadoop big data task | |
| CN111859499B (en) | Design system of modularized box-type integrated house and operation method thereof | |
| CN110781414B (en) | Route searching method and device based on geographic entity and storage medium |
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 |