Building foundation double-code network segmentation construction plan control method, medium and equipment

Abstract

The invention provides a building foundation double-code network segmentation construction plan control method, medium and equipment, and the method comprises the steps: drawing a double-code network plan diagram of a construction plan, and enumerating all lines of a double-code network; calculating the working duration of each line, and finding out a key line and key work; removing the key work in each line, and subtracting the working duration of each line from the working duration of the key line to obtain a total time difference calculation formula of each road section after the key work is removed; calculating the free time difference of each work in each road section; judging the influence of each work on the subsequent work by using the free time difference of each work; judging the influence of each work on the total construction period by utilizing a total time difference calculation formula of each road section; and for the work which affects the later work and delays the total construction period, a project progress correction measure is adopted. According to the method, a logic road section total time difference calculation formula is utilized to simultaneously inspect all dimensions and multiple items of work influencing consequences, and the actual project progress can be more accurately controlled.

Description

Technical Field

[0001] The invention belongs to the field of engineering progress control, and in particular relates to a method, medium and equipment for controlling a building foundation double-code network segmented construction plan. Background Art

[0002] The dual-code network planning technology is widely used by enterprises for various engineering schedule control, which has produced considerable economic benefits. The basic work of the calculation technology of the dual-code network plan is to establish the key lines and key tasks, calculate the total time difference and free time difference of the tasks, etc. The existing technologies include the node calculation method and the work calculation method, which are used to calculate the total time difference and free time difference of the tasks. However, these two methods are not simple enough and do not conform to the conventional thinking. The calculation process is not sufficiently related to the schedule control application, and cannot help understand the logical relationship between the total time difference and free time difference of the network tasks, which is not conducive to the actual operation and application of the project schedule control. Summary of the invention

[0003] The present invention aims to solve the problem that in the existing engineering progress control process, only key tasks, key lines, free time differences and total time differences of each task are used to investigate the full consequences of work delay plans, and provides a building foundation dual-code network segmented construction plan control method, medium and equipment.

[0004] To achieve the above object, the present invention adopts the following technical solutions:

[0005] The double-code network segmented construction plan control method for building foundation is characterized by comprising the following steps:

[0006] Draw a dual-code network plan diagram of the construction plan and enumerate the lines of the dual-code network;

[0007] Calculate the working duration of each line and find out the key lines and key tasks;

[0008] Remove the critical work from each route, and subtract the working duration of each route from the working duration of the critical route to obtain the total time difference calculation formula for each section after removing the critical work; calculate the free time difference of each work in each section;

[0009] Use the free time difference of each task to determine the impact of each task on the next task; use the total time difference calculation formula of each section to determine the impact of each task on the total construction period;

[0010] For work that is judged to affect subsequent work and delay the total construction period, corrective measures for the project progress will be taken.

[0011] To optimize the above technical solutions, the specific measures taken also include:

[0012] Furthermore, the enumeration of the lines of the dual-code network is specifically:

[0013] Starting from the starting point of the double-code network, follow the arrows in the network, draw arrow lines, and mark the work names; when encountering a fork node, draw a forked arrow line and mark the forked work name; traverse all paths of the network in sequence until the end point of the network, and the branches drawn from the starting point to the end point represent each line.

[0014] Furthermore, the free time difference of each task in each section is calculated as follows:

[0015] For critical tasks, the free time difference is 0;

[0016] For non-critical tasks, the sections that are completely composed of other sections are discarded. Based on the remaining sections after discarding, the sections that can represent the total time difference but not the free time difference are first screened out, defined as total time difference sections. The free time difference of the total time difference sections is zero, and the tasks with a free time difference of 0 in the total time difference sections are calculated based on this; then the sections that can represent both the free time difference and the total time difference are screened out, defined as full-function sections. The free time difference of the full-function sections is equal to the total time difference, and the free time difference of each task in the full-function sections is calculated based on the total time difference calculation formula of the full-function sections.

[0017] Furthermore, the use of the free time difference of each task to judge the influence of each task on the next task is specifically as follows:

[0018] Obtain the delayed work and its delay time t1 in the construction plan inspection, and compare the delay time t1 of the delayed work with its corresponding free time difference t2. If t1>t2, the delayed work affects the subsequent work, and the affected time is t1-t2; if t1≤t2, the delayed work does not affect the subsequent work.

[0019] Furthermore, the total time difference calculation formula of each section is used to determine the impact of each task on the total construction period, specifically:

[0020] Obtain the work that is not delayed in the construction plan inspection, the work that is delayed and its delay time, substitute the delay time of each work into the total time difference calculation formula of each section, compare the calculation result t3 with the total time difference t4 corresponding to each total time difference calculation formula, if t3>t4, the work of the corresponding section causes delay to the total construction period, and the delay time is t3-t4; if t3≤t4, the work of the corresponding section does not cause delay to the total construction period.

[0021] Furthermore, for the work that is judged to affect the subsequent work and delay the total construction period, the project progress correction measures are taken, specifically:

[0022] Give warnings to those works that affect the following works but do not delay the total construction period;

[0023] For the work in each section that delays the total construction period, the frequency of occurrence of each work is counted, and corrective measures of varying degrees are implemented in order of frequency of occurrence, from high to low.

[0024] Accordingly, the present invention proposes a computer-readable storage medium storing a computer program, characterized in that the computer program enables a computer to execute the building foundation double-code network segmented construction plan control method as described above.

[0025] Correspondingly, the present invention proposes an electronic device, characterized in that it includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, it implements the building foundation dual-code network segmented construction plan control method as described above.

[0026] The beneficial effects of the present invention are as follows: the present invention utilizes the total time difference calculation formula of the logical section to conduct a full-dimensional and simultaneous investigation of the consequences of work delay plans, and in combination with the investigation using the free time difference, it is possible to accurately monitor the overall consequences of simultaneous delays in plans for multiple works, which can be effectively applied in actual engineering progress control work and can effectively promote the scientific application of dual-code network plans; the logical section method adopted in the present invention has the advantages of simple operation and easy understanding, and the relevant logical sections in the calculation process can be directly applied to the actual operation of progress control. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 It is a double-code network planning diagram of the construction plan.

[0028] Figure 2 It is a schematic diagram that enumerates the lines of the double-code network.

[0029] Figure 3 This is a schematic diagram of the lines of a double-code network calculated using the arrow convergence method.

[0030] Figure 4 It is a schematic diagram of the lines of a double-code network calculated using the grid calculation method.

[0031] Figure 5 This is logic unit example one.

[0032] Figure 6 This is logic unit example two.

[0033] Figure 7 yes Figure 5 and Figure 6 Schematic diagram obtained after overlapping and merging.

[0034] Figure 8 yes Figure 7 Simplified schematic diagram.

[0035] Fig. 9 yes Figure 8 Simplified schematic diagram. DETAILED DESCRIPTION

[0036] The technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application.

[0037] In a double-code network plan, in order to find the total time difference and free time difference of the work, the key line of the network must be found first. The usual practice is to start from the starting node, calculate the duration of the work item by item along the arrow direction until the end point, find the line, compare the working duration of each line, and the longest one is the key line. This search method is easy to miss the line. To prevent missing lines, the present invention provides a method for enumerating lines - the tree branch method.

[0038] Starting from the starting node of the network, follow the arrow, draw an arrow line, mark the work name, draw a forked arrow line when encountering a fork node, mark the forked work name, first draw all the forked work item by item along a certain line until the end of the network; then follow the first forked arrow line in the direction of the arrow, draw all the forked work item by item, until the end of the network; and so on, follow the arrow, draw all the forked arrow line work to the end. This method of marking network lines like tree branches is called the tree branch method. The biggest advantage of the tree branch method: because this method has a forked arrow line prompt, the branch end is used as the end point work as an identifier, and the lines are listed without omission, and the image is beautiful and intuitive. Figure 1 The double-code network plan diagram of the construction plan shown in the figure, the lines drawn using the tree branch method are as follows Figure 2 As shown, there are 20 lines in total.

[0039] In order to verify whether all lines are enumerated, the present invention provides three methods for calculating the number of double-code network lines, which are used to calculate the number of lines in the network and assist in verifying the number of lines enumerated by the tree branch method.

[0040] The three methods for calculating the lines of the double-code network diagram provided by the present invention are:

[0041] The first one, called the arrow convergence method, can be used for all arrow network diagrams.

[0042] The second method is called grid calculation method, which can be used for grid-type double-code network diagrams for segmented construction.

[0043] The third method is called the process combination method, which can be used for grid-type double-code network diagrams for segmented construction.

[0044] First, let's introduce the arrow convergence method. Start from the starting point and follow the arrow direction. Each arrow is labeled 1. When you encounter a node along the arrow direction, each arrow from the node is labeled with the number of arrows converging at the node. Continue along the arrow direction until the end of the network. Add up the labeled numbers of the arrows converging to the end point. The sum is the number of lines in the network. For example, Figure 1 The number of lines, Figure 1 The total number of lines is Figure 3 As shown, there are 20 lines in total.

[0045] The second type is that in the segmented construction network plan, the segmented network due to virtual work is in a grid type, such as Figure 1 As shown in the figure, it is called a grid network diagram. The horizontal and vertical nodes of the grid are first marked as 1, and the second node in the second row is marked as the sum of the numbers of the two nodes on the vertical diagonal line in the first grid, that is, 2. From left to right and from top to bottom, until the node at the bottom right corner is marked, the number of marks on the node is the number of lines in the network. For example, Figure 1 The number of lines is as follows Figure 4 shown.

[0046] The third method is to set the number of construction process as m, which is a natural number greater than 1; and the number of planned construction sections as n, which is a natural number greater than 1. Using the combination principle, the number of lines in the double-code network plan diagram for segmented construction is: or This method is called process combination. For example, Figure 1 The process combination method is:

[0047] exist Figure 5 In the example, the total time difference and free time difference of A's work are 4 and 0 respectively; the total time difference and free time difference of B's ​​work are 5 and 5 respectively. Figure 6 In the example, the total time difference and free time difference of A's work are 5 and 4 respectively; the total time difference and free time difference of B's ​​work are 1 and 1 respectively. Figure 5 and Figure 6 Overlapping and merging, it becomes Figure 7 At this time, the total time difference and free time difference of A's work are 4 and 4 respectively; the total time difference and free time difference of B's ​​work are 1 and 1 respectively. Figure 7 Can be simplified to Figure 8 , which is further simplified to Fig. 9 . Fig. 9 In the example, the total time difference and free time difference of A's work are 4 and 4 respectively; the total time difference and free time difference of B's ​​work are 1 and 1 respectively. Figure 7 , Figure 8The same. This shows that two virtual works in opposite directions can be combined into a real node (a node not connected to a virtual work), that is, a real node is composed of two virtual works in opposite directions. Conversely, a real node can also be split into two virtual works in opposite directions. Inspired by this, nodes should be functionally classified, and sections composed of nodes should also be functionally classified. The working duration of the section should be related to the total time difference and free time difference of the work. The law of the total time difference of the work has been found: in the total time difference section calculation formula, the total time difference of the work presents the minimum value, and the free time difference of the work should also be related to the total time difference section calculation formula.

[0048] In a network diagram, a path that starts from the starting node, passes through a series of arrows and nodes in the direction of the arrow, and finally reaches the end point is called a line. In a line, the working path along the direction of the arrow between any two nodes is called a section. Two sections between any two key nodes, one section has all the key work, called a key section, and the other section has non-key work, called a non-key section. The network composed of these two sections is called a network logic unit, which is the basic unit of a complex network. Network logic units can form a complex network plan diagram through series and parallel connection or even overlapping mergers. A complex network plan diagram can be split into several network logic units, which are composed of key sections and non-key sections.

[0049] Full-function node: In a logical unit, the operation time range of work on non-critical sections is equal to the total operation time range of critical work between corresponding critical nodes, and at the same time, the operation time range of non-critical work of this logical unit can be limited, and there is no intersection with the operation time range of work outside this logical unit. Such a logical unit is called a full-function network logical unit, and the key nodes at both ends of the full-function network logical unit are called full-function nodes. Figure 5 , 6 ,7,8, nodes ①,⑧; Fig. 9 In the example, nodes ①, ②, and ③ can be judged based on the logical function of the dual-code network itself.

[0050] Semi-functional node: In a logical unit, the operation time of non-critical work of this logical unit can be limited, and the operation time range is equal to the operation time range of critical work of the critical node, but the operation time range of the work of this logical unit and the work outside this logical unit cannot be limited. Such a logical unit is called a semi-functional network logical unit. The node whose immediate preceding and immediate following work and operation activity time intersect is called a semi-functional node. Figure 5 , 6 In the figure, nodes ② and ③.

[0051] Virtual work is divided into entry virtual work and exit virtual work, among which entry virtual work is virtual work introduced from key nodes, and exit virtual work is virtual work derived from key nodes. The nodes at both ends of entry virtual work are called total time difference nodes. The nodes at both ends of exit virtual work are called free time difference nodes. The nodes at both ends of entry virtual work and exit virtual work are called semi-functional nodes. On the critical line, the key nodes not associated with virtual work are all fully functional nodes. In the network, nodes other than fully functional nodes and semi-functional nodes are general nodes.

[0052] Therefore, nodes are divided into full-function nodes, semi-function nodes, and general nodes according to their functions. Semi-function nodes are divided into total time difference nodes and free time difference nodes. According to the combination of full-function nodes and semi-function nodes, road sections are divided into full-function sections, free time difference sections, and total time difference sections. The node at the front of the road section is the arrow end node, and the node at the end of the road section is the tail end node.

[0053] Full-function section: In the logic unit, the tail node of the non-critical section is a full-function node or a free time difference node, and the arrow end node is a section composed of full-function nodes. The working duration of the critical section minus the working duration of the non-critical section is equal to the total time difference and free time difference of the section. Such a section total time difference calculation formula has the function of expressing the total time difference and free time difference of the section. Such a section is called a full-function section. For example Figure 5 , Figure 6 Middle section ①-②-⑧, ①-③-⑧, Figure 7 The sections in the road are ①-②-⑤-⑧.

[0054] Free time difference section: The tail node of a non-critical section is a full-function node or a free time difference node, and the arrow end node is a section composed of free time difference nodes. In the network, although the non-critical section and the corresponding critical section do not constitute a network logic unit, the working duration of the critical section minus the working duration of the non-critical section has the meaning of representing the free time difference of the section. This is also the reason why the sum of the free time differences of each work on the section is equal to the free time difference of the section. Such a section is called a free time difference section. For example Figure 6 Middle section ②-③-⑧.

[0055] Total time difference section: In the logic unit, the tail node of the non-critical section is a full-function node or a free time difference node, and the arrow end node is a section composed of total time difference nodes. The working duration of the critical section minus the working duration of the non-critical section has the function of representing the total time difference of the section. The free time difference of the section is zero. Such a section is called a total time difference section. For example Figure 5 Middle section ①-②-③.

[0056] The attributes of the end node of a road section determine the functional attributes of the road section. A road section whose end node is a full-function node has the function of indicating the total time difference and free time difference of the road section; a road section whose end node is a total time difference node has the function of indicating the total time difference of the road section, and the free time difference is zero; a road section whose end node is a free time difference node has the function of indicating the free time difference of the road section. A full-function node is actually a combination of a free time difference node and a total time difference node.

[0057] Regarding the definition of total time difference, in each logical unit of the network, the total time difference of a certain work is the one with the smallest total time difference among all logical sections containing the work, that is, the total time difference of the work is determined by the logical unit of the logical section containing the smallest total time difference of the work, and its size is the duration of the work on the critical section minus the duration of the work on the non-critical section. In other words, the total time difference has the property of being the smallest. The total time difference of the work means that the maneuvering time of the work without affecting the total construction period is expressed under the premise that all other works in the network remain unchanged.

[0058] Full-function section: The sum of the free time differences of each work on the section is equal to the free time difference of the section, equal to the total time difference of the section, and equal to the difference between the working duration of the corresponding key section of the section and the working duration of the section.

[0059] Free time difference section: The sum of the free time differences of each working section is equal to the free time difference of the section, which is equal to the difference between the working duration of the corresponding key section of the section and the working duration of the section.

[0060] Total time difference section: The total time difference of this section is equal to the difference between the working duration of the key section corresponding to this section and the working duration of this section. The free time difference of this section is zero.

[0061] Logical section method: subtract the working duration of non-critical lines from the working duration of critical lines in the network, and after removing critical work, obtain the total time difference calculation formula for the working logical section or section combination. Use the logical sections to represent the meaning of total time difference and free time difference, and obtain the total time difference and free time difference of the work. This method of calculating the total time difference and free time difference of the work is called the logical section method.

[0062] The total time difference of work is calculated by the logical section method. The principle is that the total time difference is the smallest among the total time differences of each section. The free time difference of work is calculated by the logical section method. The principle is that the sum of the free time differences of each work in the full-function section and the free time difference section is equal to the total time difference of the section, and the free time difference of the total time difference section is zero. When distinguishing the types of logical sections, first filter out the combined sections (sections that can be combined by adding other sections together); secondly, in the filtered sections, combine the network logic unit structure to distinguish the section types, and then filter out the applicable logical sections, and perform free time difference addition and subtraction operations to calculate the free time difference of work.

[0063] In the process of using the dual-code network plan to control the project progress, it is not possible to examine the full consequences of work delay plans by only using key tasks, key routes, free time differences and total time differences of each task. The reason is that the total time difference only reflects the maximum maneuvering time of a certain task that does not affect the total construction period when other tasks remain unchanged, and what is examined is the consequences of a delay plan for a certain task; and for a complex dual-code network plan, the state of delaying a certain task rarely occurs. In most cases, multiple work delay plans appear at the same time. Therefore, the total time difference calculation formula of the logical section must be used to conduct a full-dimensional and simultaneous examination of multiple tasks that affect the consequences. Only by combining the two with the use of free time difference examination can the full picture of the consequences of delaying multiple tasks at the same time be seen.

[0064] In the process of calculating the total time difference and free time difference of each work of the double-code network plan, the intermediate result, namely the logical section calculation formula, is clearly defined as the calculation result of the double-code network, and is applied in the actual engineering progress control work, which can effectively promote the scientific application of the double-code network plan. The present invention reveals the logical laws of total time difference and free time difference in the process of calculating the total time difference and free time difference of the work, making the double-code network plan no longer mysterious, and enhancing people's confidence in using the double-code network to control the progress of the project.

[0065] In one embodiment, the present invention proposes a construction plan control method for building foundation double-code network segmentation. For example, at a certain building construction site, the independent foundation segmentation construction process is foundation excavation A, steel bar binding B, formwork support C, concrete pouring D; it is divided into four sections for sequential construction, and the duration of each section is shown in Table 1; based on this condition requirement, a double-code network construction plan is formulated. On a certain day, the construction plan inspection found that work A2, A3, B4, C2, D2, and D3 were delayed by 2 days, 2 days, 1 day, 1 day, 3 days, and 2 days respectively. The specific steps of applying this method to construction plan control are as follows.

[0066] Table 1 Duration of construction in sections

[0067]

[0068] 1. Draw a double-code network plan diagram.

[0069] Draw a double-code network plan diagram based on the conditions, such as Figure 1 As shown, the unit of working duration is day.

[0070] 2. Use the tree branch method to enumerate the lines in the network.

[0071] Line enumeration tree method Figure 2 As shown, there are 20 lines in total.

[0072] 3. Use the arrow convergence method to calculate the number of network lines and verify whether the number of lines enumerated by the tree branch method is correct.

[0073] Use the arrow convergence method to calculate the number of network lines. The process is as follows Figure 2 , Figure 1 There are 20 lines in total. The tree branch method enumerates the number of lines correctly.

[0074] 4. Calculate the working duration of each line, find out the key lines and key tasks, and mark the key lines with thick lines.

[0075] A1+A2+A3+A4+B4+C4+D4=4+3+3+4+4+4+4=26 (days); (1)

[0076] A1+A2+A3+B3+B4+C4+D4=4+3+3+5+4+4+4=27 (days); (2)

[0077] A1+A2+A3+B3+C3+C4+D4=4+3+3+5+5+4+4=28 (days); (3)

[0078] A1+A2+A3+B3+C3+D3+D4=4+3+3+5+5+3+4=27 (days); (4)

[0079] A1+A2+B2+B3+B4+C4+D4=4+3+4+5+4+4+4=28 (days); (5)

[0080] A1+A2+B2+B3+C3+C4+D4=4+3+4+5+5+4+4=29 (days); (6)

[0081] A1+A2+B2+B3+C3+D3+D4=4+3+4+5+5+3+4=28 (days); (7)

[0082] A1+A2+B2+C2+C3+C4+D4=4+3+4+4+5+4+4=28 (days); (8)

[0083] A1+A2+B2+C2+C3+D3+D4=4+3+4+4+5+3+4=27 (days); (9)

[0084] A1+A2+B2+C2+D2+D3+D4=4+3+4+4+3+3+4=25 (days); (10)

[0085] A1+B1+B2+B3+B4+C4+D4=4+5+4+5+4+4+4=30 (days); (11)

[0086] A1+B1+B2+B3+C3+C4+D4=4+5+4+5+5+4+4=31 (days); (12)

[0087] A1+B1+B2+B3+C3+D3+D4=4+5+4+5+5+3+4=30 (days); (13)

[0088] A1+B1+B2+C2+C3+C4+D4=4+5+4+5+4+4=30 (days); (14)

[0089] A1+B1+B2+C2+C3+D3+D4=4+5+4+4+5+3+4=29 (days); (15)

[0090] A1+B1+B2+C2+D2+D3+D4=4+5+4+4+3+3+4=27 (days); (16)

[0091] A1+B1+C1+C2+C3+C4+D4=4+5+3+4+5+4+4=29 (days); (17)

[0092] A1+B1+C1+C2+C3+D3+D4=4+5+3+4+5+3+4=28 (days); (18)

[0093] A1+B1+C1+C2+D2+D3+D4=4+5+3+4+3+3+4=26 (days); (19)

[0094] A1+B1+C1+D1+D2+D3+D4=4+5+3+5+3+3+4=27 (days). (20)

[0095] Because (12) has the longest duration, the critical path is: A1+B1+B2+B3+C3+C4+D4, and the key tasks are: A1, B1, B2, B3, C3, C4, D4. The total time difference and free time difference of the key tasks are zero. Use bold lines to mark the critical paths, see Figure 1 shown.

[0096] 5. Subtract the working duration of each non-critical working line from the working duration of the critical working line, and remove the critical work in each formula to obtain the following total time difference calculation formula for the section.

[0097] A2+A3+A4+B4=5(days); (1-1)

[0098] A2+A3+B4=4(days); (2-1)

[0099] A2+A3=3(days); (3-1)

[0100] A2+A3+D3=4(days); (4-1)

[0101] A2+B4=3(days); (5-1)

[0102] A2=2(days); (6-1)

[0103] A2+D3=3(days); (7-1)

[0104] A2+C2=3(days); (8-1)

[0105] A2+C2+D3=4(days); (9-1)

[0106] A2+C2+D2+D3=6(days); (10-1)

[0107] B4=1(day); (11-1)

[0108] D3=1(day); (13-1)

[0109] C2=1(day); (14-1)

[0110] C2+D3=2(days); (15-1)

[0111] C2+D2+D3=4(days); (16-1)

[0112] C1+C2=2(days); (17-1)

[0113] C1+C2+D3=3(days); (18-1)

[0114] C1+C2+D2+D3=5(days); (19-1)

[0115] C1+D1+D2+D3=4 (days). (20-1)

[0116] 6. Find the total time difference of each task.

[0117] In the calculation formula for the sections (1-1) to (11-1), (13-1) to (20-1) or the combined sections, the total time difference of each work is taken as the minimum value, and the total time differences of works A2, A3, A4, B4, C1, C2, D1, D2, and D3 are 2, 3, 5, 1, 2, 1, 4, 4, and 1 (days) respectively.

[0118] 7. Calculate the free time difference of each task.

[0119] In the calculation formula from (1-1) to (11-1), (13-1) to (20-1) or a combination of sections, (2-1) is the combination of sections (3-1) and (11-1); (4-1) is the combination of sections (3-1) and (13-1); (5-1) is the combination of sections (6-1) and (11-1); (7-1) is the combination of sections (6-1) and (13-1) ; (8-1) is a combination of sections (6-1) and (14-1); (9-1) is a combination of sections (6-1), (14-1) and (13-1); (10-1) is a combination of sections (6-1) and (16-1); (15-1) is a combination of sections (13-1) and (14-1); (18-1) is a combination of sections (13-1) and (17-1).

[0120] Therefore, (2-1), (4-1), (5-1), (7-1), (8-1), (9-1), (10-1), (15-1) (18-1) are combinations of other sections. There is no information available for calculating the free time difference of the work, so they are discarded (that is, the basic sections are retained and the combinations of sections are discarded). The total time difference calculation formula for the remaining ten sections is:

[0121] A2+A3+A4+B4=5(days); (1-1)

[0122] A2+A3=3(days); (3-1)

[0123] A2=2(days); (6-1)

[0124] B4=1(day); (11-1)

[0125] D3=1(day); (13-1)

[0126] C2=1(day); (14-1)

[0127] C2+D2+D3=4(days); (16-1)

[0128] C1+C2=2(days); (17-1)

[0129] C1+C2+D2+D3=5(days); (19-1)

[0130] C1+D1+D2+D3=4 (days). (20-1)

[0131] Classification according to the meaning of road sections:

[0132] The corresponding node sections of the road section A2+A3 in (3-1) are ②-④-⑨, where node ② is a full-function node and node ⑨ is a total time difference node. Therefore, the road section A2+A3 is a total time difference section.

[0133] The corresponding node section of the road section A2 in (6-1) is ②-④, ② is a full-function node, ④ is a total time difference node, and the road section A2 is a total time difference section.

[0134] The corresponding node segment of the road segment C2 in (14-1) is ⑧ is the free time difference node, is the total time difference node, then section C2 is the total time difference section.

[0135] The road segment C1+C2 in (17-1) corresponds to the node segment ③ is a fully functional node, is the total time difference node, then the section C1+C2 is the total time difference section.

[0136] The road segment C1+C2+D2+D3 in (19-1) corresponds to the node segment ⑥-⑧ are virtual work for entry (Note: There are virtual work ⑥-⑧ for entry in the section ③-⑥-⑧. Virtual work for entry refers to the virtual work whose arrow cannot be directly connected to the key node, but the arrow can be connected to the key node through other arrow lines. Virtual work for entry can play the role of entry line), then the section C1+C2+D2+D3 is the section with total time difference.

[0137] There are five sections that can express the total time difference of the section but cannot express the free time difference of the section: (3-1), (6-1), (14-1), (17-1), and (19-1).

[0138] According to the definition of free time difference, the free time difference of A1, A2, C1 and C2 is 0, which is expressed by A2=0, A3=0, C1=0 and C2=0.

[0139] The road section A2+A3+A4+B4 in (1-1) has the corresponding node section: ②、 If the node is a fully functional node, then the road section A2+A3+A4+B4 is a fully functional road section.

[0140] The corresponding node segment of the road segment B4 in (11-1) is If the node is a fully functional node, then section B4 is a fully functional section.

[0141] The corresponding node segment of the road segment D3 in (13-1) is If the node is a fully functional node, then section B4 is a fully functional section.

[0142] The road segment C2+D2+D3 in (16-1) corresponds to the node segment If the node is a fully functional node, then the section C2+D2+D3 is a fully functional section.

[0143] The road segment C1+D1+D2+D3 of (20-1) corresponds to the node segment If the node is a fully functional node, then the section C1+D1+D2+D3 is a fully functional section.

[0144] The sections (1-1), (11-1), (13-1), (16-1), and (20-1) are full-function sections, which can express both the total time difference and the free time difference. That is, the total time difference of the section is equal to the free time difference of the section. The sum of the free time differences of each operation of the section is equal to the free time difference of the section, which is also equal to the total time difference of the section. The free time difference of the operation can be calculated using the following free time difference calculation formula:

[0145] A2+A3+A4+B4=5(days); (1-1)

[0146] B4=1(day); (11-1)

[0147] D3=1(day); (13-1)

[0148] C2+D2+D3=4(days); (16-1)

[0149] C1+D1+D2+D3=4 (days). (20-1)

[0150] Substituting A2=0, A3=0, B4=1 into (1-1), we get A4=4 (days);

[0151] Substituting C2=0 and D3=1 into (16-1), we get D2=3 (days);

[0152] Substituting C1=0, D2=3, D3=1 into (20-1), we obtain D1=0 (days).

[0153] The free time differences of tasks A2, A3, A4, B4, C1, C2, D1, D2, and D3 are 0, 0, 4, 1, 0, 0, 0, 3, and 1 (days) respectively.

[0154] 8. The list shows the total time difference and free time difference of each task.

[0155] The total time difference and free time difference of each task are: A1(0,0), A2(2,0), A3(3,0), A4(5,4), B1(0,0), B2(0,0), B3(0,0), B4(1,1), C1(2,0), C2(1,0), C3(0,0), C4(0,0), D1(4,0), D2(4,3), D3(1,1), D4(0,0) (days). Note: Task name (total time difference, free time difference) (days).

[0156] Using the work calculation method to review and verify, the total time difference and free time difference of the above-mentioned work are correct.

[0157] 9. Use the calculation results of the dual-code network plan to determine the impact of work delays on subsequent work and the total construction period.

[0158] The calculation results of the dual-code network plan should include:

[0159] (1) The key route is: A1+B1+B2+B3+C3+C4+D4.

[0160] (2) Key tasks are: A1, B1, B2, B3, C3, C4, D4.

[0161] (3) Calculation formula for total time difference of logical section:

[0162] A2+A3+A4+B4=5(days); (1-1)

[0163] A2+A3+B4=4(days); (2-1)

[0164] A2+A3=3(days); (3-1)

[0165] A2+A3+D3=4(days); (4-1)

[0166] A2+B4=3(days); (5-1)

[0167] A2=2(days); (6-1)

[0168] A2+D3=3(days); (7-1)

[0169] A2+C2=3(days); (8-1)

[0170] A2+C2+D3=4(days); (9-1)

[0171] A2+C2+D2+D3=6(days); (10-1)

[0172] B4=1(day); (11-1)

[0173] D3=1(day); (13-1)

[0174] C2=1(day); (14-1)

[0175] C2+D3=2(days); (15-1)

[0176] C2+D2+D3=4(days); (16-1)

[0177] C1+C2=2(days); (17-1)

[0178] C1+C2+D3=3(days); (18-1)

[0179] C1+C2+D2+D3=5(days); (19-1)

[0180] C1+D1+D2+D3=4 (days). (20-1)

[0181] (4) The total time difference and free time difference of each task are: A1(0,0), A2(2,0), A3(3,0), A4(5,4), B1(0,0), B2(0,0), B3(0,0), B4(1,1), C1(2,0), C2(1,0), C3(0,0), C4(0,0), D1(4,0), D2(4,3), D3(1,1), D4(0,0) (days).

[0182] By using the free time difference of the work and the total time difference calculation formula of the logical section found in the double-code network calculation process, we can judge the impact of the delay of 2 days, 2 days, 1 day, 1 day, 3 days and 2 days for work A2, A3, B4, C2, D2 and D3 on the subsequent work and the total construction period.

[0183] First, use the free time difference of each job to judge. Compare the delay time of jobs A2, A3, B4, C2, D2, and D3, which are 2 days, 2 days, 1 day, 1 day, 3 days, and 2 days, with their free time difference of 0, 0, 1, 0, 3, and 1 (days), and we can know that the jobs with a delay time greater than the free time difference are A2, A3, C2, and D3, which exceed the free time difference by 2 days, 2 days, 1 day, and 1 day respectively. Then, jobs A2, A3, C2, and D3 affect the earliest start of the next job by 2 days, 2 days, 1 day, and 1 day respectively. The jobs with a delay time less than the free time difference are B4 and D2, which do not affect the earliest start of the next job.

[0184] Secondly, use the logical section total time difference calculation formula to determine the impact of delays of 2 days, 2 days, 1 day, 1 day, 3 days, and 2 days on the total construction period for work A2, A3, B4, C2, D2, and D3.

[0185] Tasks A2, A3, B4, C2, D2, and D3 are delayed by 2 days, 2 days, 1 day, 1 day, 3 days, and 2 days, respectively, which can be expressed as A2=2, A3=2, B4=1, C2=1, D2=3, and D3=2.

[0186] The non-critical tasks without delay plan are A4, C1, and D1, which are represented by A4=0, C1=0, and D1=O.

[0187] Substitute the work without delay plan A4=0, C1=0, D1=0 and the work with delay plan A2=2, A3=2, B4=1, C2=1, D2=3, D3=2 into the left side of the total time difference calculation formula of the logical section, compare the calculation result with the number on the right side to determine whether the construction period is delayed:

[0188] A2+A3+A4+B4=2+2+0+1=5=5 (days), the total construction period is normal; (1-2)

[0189] A2+A3+B4=2+2+0=4=4 (days), the total construction period is normal; (2-2)

[0190] A2+A3=2+2=4>3(days), the total construction period is delayed by 1 day; (3-2)

[0191] A2+A3+D3=2+2+2=6>4(days), the total construction period is delayed by 2 days; (4-2)

[0192] A2+B4=2+1=3=3 (days), the total construction period is normal; (5-2)

[0193] A2=2=2(days), the total construction period is normal; (6-2)

[0194] A2+D3=2+2=4>3(days), the total construction period is delayed by 1 day; (7-2)

[0195] A2+C2=2+1=3=3 (days), the total construction period is normal; (8-2)

[0196] A2+C2+D3=2+1+2=5>4(days), the total construction period is delayed by 1 day; (9-2)

[0197] A2+C2+D2+D3=2+1+3+2=8>6(days), the total construction period is delayed by 2 days; (10-2)

[0198] B4=1=1(day), the total construction period is normal; (11-2)

[0199] D3 = 2% 1 (day), the total construction period is delayed by 1 day; (13-2)

[0200] C2=1=1(day), the total construction period is normal; (14-2)

[0201] C2+D3=1+2=3>2(days), the total construction period is delayed by 1 day; (15-2)

[0202] C2+D2+D3=1+3+2=6>4(days), the total construction period is delayed by 2 days; (16-2)

[0203] C1+C2=0+1=1<2(days), the total construction period is normal; (17-2)

[0204] C1+C2+D3=0+1+2=3=3(days), the total construction period is normal; (18-2)

[0205] C1+C2+D2+D3=0+1+3+2=6>5(days), the total construction period is delayed by 1 day; (19-2)

[0206] C1+D1+D2+D3=0+0+3+2=5>4(days), the total construction period is delayed by 1 day. (20-2)

[0207] From (11-2), we can know that work B4 does not delay the total construction period. The relationship equations for delaying the total construction period are (3-2), (4-2), (7-2), (9-2), (10-2), (13-2), (15-2), (16-2), (19-2), (20-2); the related work is: A2, A3, Cl, C2, D1, D2, D3, among which work C1 and D1 are known conditions and have no delay plan, so they are discarded. The work that delays the total construction period is: A2, A3, C2, D2, D3.

[0208] From (3-2), we can see that work A2 and A3 together delay the total construction period by 1 day; from (4-2), we can see that work A2, A3, and D3 together delay the total construction period by 2 days; from (7-2), we can see that work A2 and D3 together delay the total construction period by 1 day; from (9-2), we can see that work A2, C2, and D3 together delay the total construction period by 1 day; from (10-2), we can see that work A2, C2, D2, and D3 together delay the total construction period by 2 days; from (13-2), we can see that work D3 delays the total construction period by 1 day; from (15-2), we can see that work C2 and D3 together delay the total construction period by The total construction period is delayed by 1 day. From (16-2), we can know that work C2, D2 and D3 jointly delay the total construction period by 2 days. From (19-2), we can know that work C1, C2, D2 and D3 jointly delay the total construction period by 1 day. Since work C1 has no delay plan, the responsibility for the delay of 1 day is borne by work C2, D2 and D3 jointly. From (20-2), we can know that work C1, D1, D2 and D3 jointly delay the total construction period by 1 day. Since work C1 and D1 have no delay plan, the responsibility for the delay of 1 day is borne by work D2 and D3 jointly.

[0209] In summary, tasks A2, A3, B4, C2, D2, and D3 are delayed by 2 days, 2 days, 1 day, 1 day, 3 days, and 2 days, respectively, and their impact on the subsequent tasks and the total construction period is as follows:

[0210] (1) Tasks B4 and D2 have no impact on the next task and can start the earliest.

[0211] (2) For tasks A2, A3, C2, and D3, the earliest start time for the next work to be affected is 2 days, 2 days, 1 day, and 1 day respectively (calculated based on the free time difference).

[0212] (3) The total construction period is delayed by 1 day. The tasks involved are: A2, A3, C2, D2, and D3. There are seven dimension combinations: tasks A2 and A3 together delay the total construction period by 1 day; tasks A2 and D3 together delay the total construction period by 1 day; tasks A2, C2, and D3 together delay the total construction period by 1 day; tasks D3 delay the total construction period by 1 day; tasks C2 and D3 together delay the total construction period by 1 day; tasks C2, D2, and D3 together delay the total construction period by 1 day; tasks D2 and D3 together delay the total construction period by 1 day.

[0213] (4) The total construction period is delayed by 2 days. The tasks involved are: A2, A3, C2, D2, and D3. There are three dimensional combinations: tasks A2, A3, and D3 together delay the total construction period by 2 days; tasks A2, C2, and D3 together delay the total construction period by 2 days; tasks C2, D2, and D3 together delay the total construction period by 2 days.

[0214] (5) The overall network plan delayed the total construction period by 2 days.

[0215] 10. Propose corrective measures for the project progress based on the consequences of delaying subsequent work and the total construction period.

[0216] Although tasks B4 and D2 do not affect the earliest start of the subsequent work, they do delay the plan and are not encouraged, advocated or criticized.

[0217] Tasks A2, A3, C2, and D2 will affect the earliest start of the subsequent work by 2 days, 2 days, 1 day, and 1 day respectively. Although the total construction period is not delayed, the earliest start of the subsequent work will be affected and a warning should be given.

[0218] Work A2 and A3 together delayed the total construction period by 1 day; Work D3 delayed the total construction period by 1 day; Work D2 and D3 delayed the total construction period by 1 day; Work C2, D2, and D3 together delayed the total construction period by 2 days. The overall network plan was delayed by 2 days.

[0219] Those responsible for delaying the total construction period by 1 day: Work A2, A3, C2, D2, D3, the frequencies of occurrence in the seven dimensions are 3, 1, 3, 2, and 6 respectively. Those responsible for delaying the total construction period by 2 days: Work A2, A3, C2, D2, D3, the frequencies of occurrence in the three dimensions are 2, 1, 2, 2, and 3 respectively. According to the consequences of delaying the total construction period and the frequency of delay, the sanctions should be increased in the order of A3, D2, A2, C2, and D3 in accordance with the prescribed system, among which the sanctions for Work A2 and C2 are at the same level, and corrective measures for the project progress are proposed at the same time: improve work efficiency or increase workers or legally extend working hours, etc., focus on Work D3, then Work A2, C2, D2, and finally Work A3, and strive to catch up with the project progress plan before the next construction cycle inspection.

[0220] 11. Check and correct the construction progress, implement dynamic cycles, and continuously improve until the project progress goals are achieved.

[0221] In another embodiment, the present invention proposes a computer-readable storage medium storing a computer program, wherein the computer program enables a computer to execute the building foundation dual-code network segmented construction plan control method as described in the first embodiment.

[0222] In another embodiment, the present invention proposes an electronic device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the building foundation dual-code network segmented construction plan control method as described in Example 1 is implemented.

[0223] In the embodiments disclosed in the present application, the computer storage medium can be a tangible medium that can contain or store a program for use by or in conjunction with an instruction execution system, device or equipment. The computer storage medium can include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the above. More specific examples of computer storage media can include electrical connections based on one or more lines, portable computer disks, hard disks, random access memories (RAM), read-only memories (ROM), erasable programmable read-only memories (EPROM or flash memory), optical fibers, portable compact disk read-only memories (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the above.

[0224] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed in this application can be implemented in electronic hardware or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0225] The above are only preferred embodiments of the present invention, and the protection scope of the present invention is not limited to the above embodiments. All technical solutions under the concept of the present invention belong to the protection scope of the present invention. It should be pointed out that for ordinary technicians in this technical field, some improvements and modifications without departing from the principle of the present invention should be regarded as the protection scope of the present invention.

Claims

1. A double-code network segmented construction plan control method for building foundations, characterized in that: The steps include: Draw a dual-code network plan diagram of the construction plan and enumerate the lines of the dual-code network; Calculate the working duration of each line and find out the key lines and key tasks; Remove the critical work from each route, and subtract the working duration of each route from the working duration of the critical route to obtain the total time difference calculation formula for each section after removing the critical work; Calculate the free time difference of each work in each section; Use the free time difference of each task to determine the impact of each task on the next task; use the total time difference calculation formula of each section to determine the impact of each task on the total construction period; For work that is judged to affect subsequent work and delay the total construction period, corrective measures for the project progress will be taken.

2. The building foundation double-code network segmented construction plan control method as claimed in claim 1, characterized in that: The enumeration of the lines of the dual-code network is specifically: Starting from the starting point of the double-code network, follow the arrows in the network, draw arrow lines, and mark the work names; when encountering a fork node, draw a forked arrow line and mark the forked work name; traverse all paths of the network in sequence until the end point of the network, and the branches drawn from the starting point to the end point represent each line.

3. The building foundation double-code network segmented construction plan control method as claimed in claim 1, characterized in that: The calculation of the free time difference of each work in each section is specifically as follows: For critical tasks, the free time difference is 0; For non-critical tasks, the sections that are completely composed of other sections are discarded. Based on the remaining sections after discarding, the sections that can represent the total time difference but not the free time difference are first screened out, defined as total time difference sections. The free time difference of the total time difference sections is zero, and the tasks with a free time difference of 0 in the total time difference sections are calculated based on this; then the sections that can represent both the free time difference and the total time difference are screened out, defined as full-function sections. The free time difference of the full-function sections is equal to the total time difference, and the free time difference of each task in the full-function sections is calculated based on the total time difference calculation formula of the full-function sections.

4. The building foundation double-code network segmented construction plan control method as claimed in claim 1, characterized in that: The method of using the free time difference of each task to judge the influence of each task on the next task is as follows: Obtain the delayed work and its delay time t1 in the construction plan inspection, and compare the delay time t1 of the delayed work with its corresponding free time difference t2. If t1>t2, the delayed work affects the subsequent work, and the affected time is t1-t2; if t1≤t2, the delayed work does not affect the subsequent work.

5. The building foundation double-code network segmented construction plan control method as claimed in claim 1, characterized in that: The total time difference calculation formula of each section is used to determine the impact of each task on the total construction period, specifically: Obtain the work that is not delayed in the construction plan inspection, the work that is delayed and its delay time, substitute the delay time of each work into the total time difference calculation formula for each section, compare the calculation result t3 with the total time difference t4 corresponding to each total time difference calculation formula, if t3>t4, the work of the corresponding section causes delay to the total construction period, and the delay time is t3-t4; if t3≤t4, the work of the corresponding section does not cause delay to the total construction period.

6. The building foundation double-code network segmented construction plan control method as claimed in claim 1, characterized in that: For the work that is judged to affect the subsequent work and delay the total construction period, the project progress correction measures shall be taken, specifically: Give warnings to those works that affect the following works but do not delay the total construction period; For the work in each section that delays the total construction period, the frequency of occurrence of each work is counted, and corrective measures of varying degrees are implemented in order of frequency of occurrence, from high to low.

7. A computer-readable storage medium storing a computer program, characterized in that: The computer program enables the computer to execute the building foundation double-code network segmented construction plan control method as described in any one of claims 1-6.

8. An electronic device, characterized in that: include: A memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the building foundation dual-code network segmented construction plan control method as described in any one of claims 1 to 6 is implemented.

Images