Lighting power supply engineering construction progress control method and system

Abstract

The application relates to the technical field of engineering management, and discloses a lighting power supply engineering construction progress management and control method and system. The method comprises the following steps: calculating a process node progress deviation, combining resource common working hours to construct a resource coupling propagation graph to obtain a propagation influence degree, screening a target node and a candidate resource allocation scheme according to the propagation influence degree, re-calculating the scheme as a disturbance into the propagation graph, and screening a self-consistent resource allocation scheme by comparing the maximum values of the propagation influence degrees before and after the disturbance. The application solves the problems that in the prior art, process node progress deviations are independently calculated, resource common relations cannot be identified, resulting in lagging conduction, and after the execution of a resource allocation scheme, new lagging may be caused at a node that is drawn from the resource allocation scheme, and the new lagging cannot be judged in advance.

Description

Technical Field

[0001] This application relates to the field of engineering management technology, and in particular to a method and system for controlling the construction progress of lighting power supply projects. Background Technology

[0002] Lighting power supply projects typically involve multiple work stages, including issuing work commencement orders, cable laying, installation of distribution boxes and cabinets, installation of lighting fixtures, construction of grounding devices, power commissioning, and final acceptance. These work stages often require sharing the same electrician team or equipment within the contract period. Current construction progress control methods typically involve the responsible person providing daily feedback on the actual completion percentage of each work stage according to the work breakdown structure. The system then aggregates this information level by level to generate the actual progress value for the next higher level and compares it with the planned progress value to obtain the independent progress deviation value for each work stage. This allows for the triggering of warnings for work stages that exceed preset limits. In addition, a resource-constraint-based progress management method exists in project management. This method identifies the resource constraints on each work stage activity during network planning and inserts reserved time margins before and after key work stage activities to absorb potential delays caused by resource handover.

[0003] The two existing methods described above have significant shortcomings when applied to lighting and power supply projects with short construction periods and high-frequency overlapping operations. Firstly, the deviation feedback method, which aggregates deviations independently for each node, can only calculate the progress deviation of a single node, failing to consider the resource usage relationships between that node and other nodes due to sharing the same construction team or equipment. This makes it impossible to identify whether a delay in one node will be transmitted to other nodes through resource sharing, and thus impossible to predict which nodes will be affected before the delay spreads. Secondly, the management method based on resource constraints and reserved time margins sets these margins statically during the network planning phase, without adjusting them according to the dynamic changes in the actual resources invested by each node during construction. When a node lags and requires personnel or equipment to be transferred from other nodes for correction, the resource reduction caused by this transfer and the potential new delays it may trigger are not reinstated in the progress monitoring and calculation. The correction action effectively becomes an unassessed disturbance outside the original deviation monitoring system.

[0004] Therefore, in lighting power supply projects with short construction periods and multiple overlapping processes, the primary problem with existing technologies is that the schedule deviations of each process node can only be calculated independently and cannot reflect the interrelationships caused by resource sharing. This means that the lag risk of a certain node cannot be transmitted to other nodes with resource sharing relationships in advance and identified. Even if a resource constraint management approach is further introduced to identify the resource sharing relationships between nodes and generate a corrective plan for resource allocation, the execution of this corrective plan itself will change the resource input level of the allocated node, thereby creating a new lag risk at the allocated node that was not calculated when the corrective plan was generated and can only be discovered in the next monitoring cycle. That is, the corrective behavior changes from a measure to reduce known lags to a new source of disturbance that creates unknown lags. This progressive effect makes it impossible for existing technologies to determine whether the resource allocation plan itself will cause more severe lags than before the allocation before the plan is officially implemented. Summary of the Invention

[0005] This application provides a method and system for controlling the construction progress of lighting power supply projects. It solves the problems in the prior art where the progress deviation of process nodes is calculated independently, the inability to identify the lag caused by resource sharing relationships, and the inability to predict in advance that new lags may be caused at the adjustment points after the resource allocation plan is implemented. This allows the resource allocation plan to be verified before formal implementation to determine whether it will cause more serious lags than before the allocation within the process nodes covered by the resource coupling relationship.

[0006] Firstly, this application provides a method for controlling the construction progress of a lighting power supply project, the method comprising: Step S1: Obtain the progress deviation data of the process node based on the difference between the planned completion amount and the actual completion amount of the process node; Step S2: Based on the schedule deviation data and the shared working hours of resources between the process nodes, construct a resource coupling propagation diagram to obtain the propagation influence degree of the process nodes; Step S3: Target process nodes are obtained by filtering based on the propagation impact degree, and candidate resource allocation schemes are obtained by filtering based on the shared working hours associated with the target process nodes. Step S4: Substitute the candidate resource allocation scheme as perturbation data into the resource coupling propagation graph, and calculate the resource coupling propagation graph after substituting the perturbation data using a propagation calculation algorithm to obtain the propagation impact degree after perturbation. Based on the comparison result between the maximum value of the propagation impact degree and the maximum value of the propagation impact degree after perturbation, a self-consistent resource allocation scheme is obtained by screening the candidate resource allocation schemes.

[0007] Secondly, this application provides a construction progress control system for lighting power supply projects, the system comprising: The calculation module is used to obtain the progress deviation data of the process node based on the difference between the planned completion amount and the actual completion amount of the process node; The module is used to construct a resource coupling propagation graph based on the schedule deviation data and the shared working hours between the process nodes, and to obtain the propagation influence degree of the process nodes; The filtering module is used to filter target process nodes by the propagation impact degree and to filter candidate resource allocation schemes by the shared working hours associated with the target process nodes. The comparison module is used to substitute the candidate resource allocation schemes as perturbation data into the resource coupling propagation graph, calculate the resource coupling propagation graph after substituting the perturbation data using a propagation calculation algorithm, obtain the propagation impact degree after perturbation, and obtain a self-consistent resource allocation scheme by screening the candidate resource allocation schemes based on the comparison result between the maximum value of the propagation impact degree and the maximum value of the propagation impact degree after perturbation.

[0008] Thirdly, a lighting power supply project construction progress control device is provided, comprising: a memory and at least one processor, wherein the memory stores instructions; the at least one processor invokes the instructions in the memory to cause the lighting power supply project construction progress control device to execute the above-described lighting power supply project construction progress control method.

[0009] Fourthly, a computer-readable storage medium is provided, wherein instructions are stored in the computer-readable storage medium, which, when executed on a computer, cause the computer to perform the above-described method for controlling the construction progress of a lighting power supply project.

[0010] The technical solution provided in this application calculates the progress deviation data by measuring the difference between the planned and actual completion amounts of each process node. This eliminates the reliance on manual, step-by-step percentage feedback for progress control, instead directly quantifying the progress status of each node as the smallest unit. This provides a clear numerical basis for determining whether a node will affect other nodes. Furthermore, by combining the progress deviation data with the resource-sharing time between process nodes to construct a resource coupling propagation graph, the progress deviations of each process node, which were originally calculated independently, are incorporated into the same graph structure that reflects resource occupancy relationships and recalculated. This yields a propagation impact degree that reflects the degree of mutual connection between nodes. This approach transforms the previously undeterminable state of whether the lag of a certain process node can propagate to other nodes through resource sharing relationships into a specific value that can be directly calculated from the edge weights and propagation operations on the graph structure. This overcomes the deficiency of the existing technology's node-by-node independent deviation feedback method, which cannot identify resource-sharing relationships. Furthermore, by filtering target process nodes based on the propagation impact degree and filtering candidate resource allocation schemes based on the shared working hours associated with the target process nodes, the determination of resource allocation targets no longer relies on manual experience judgment, but is directly driven by the propagation impact degree, which has already incorporated resource association relationships. The selection path of allocation targets is consistent with the graph structure data calculated in the previous steps, avoiding the situation where the allocation scheme and the deviation monitoring system are disconnected.

[0011] In this application, candidate resource allocation schemes are substituted into the resource coupling propagation graph as disturbance data. The propagation calculation algorithm is then used to recalculate the propagation impact degree after the disturbance data is substituted into the graph. A self-consistent resource allocation scheme is selected based on the comparison between the maximum propagation impact degree and the maximum propagation impact degree after the disturbance. This technical feature ensures that candidate resource allocation schemes are treated as a disturbance to the graph structure and re-substituted into the same propagation calculation algorithm before formal execution, rather than using the algorithm as a one-time prediction tool. Therefore, this algorithm is applicable in the lighting power supply engineering construction progress control scenario where this scheme is applied. It is given the function of pre-verifying the corrective action itself, so that the output of the algorithm is no longer limited to identifying existing lag risks, but can also identify new lag risks that may be generated in other process nodes after the resource allocation plan is implemented. This reflects the actual contribution of the algorithm after its features are combined with specific application scenarios. That is, the algorithm's reuse method and judgment criteria are set around the specific technical problem of resource sharing in process nodes in lighting power supply projects, rather than a simple application of general computing tools that are detached from the scenario. This makes the executability judgment of the resource allocation plan have clear calculation basis and verifiable data chain. Attached Figure Description

[0012] To more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0013] Figure 1 This is a schematic diagram of one embodiment of the lighting power supply engineering construction progress control method in this application. Figure 2 This is a schematic diagram illustrating the propagation influence of each process node in the embodiments of this application; Figure 3 This is a schematic diagram illustrating the ranking criteria for candidate resource donor nodes in an embodiment of this application. Detailed Implementation

[0014] This application provides a method and system for controlling the construction progress of a lighting power supply project. The terms "first," "second," "third," "fourth," etc. (if present) in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments described herein can be implemented in a sequence other than that illustrated or described herein. Furthermore, the terms "comprising" or "having" and any variations thereof are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or devices.

[0015] For ease of understanding, the specific process of the embodiments of this application is described below. Please refer to [link / reference]. Figure 1 One embodiment of the method for controlling the construction progress of lighting power supply projects in this application includes: Step S1: Obtain the progress deviation data of the process node based on the difference between the planned completion quantity and the actual completion quantity of the process node; Specifically, a process node refers to the smallest progress control unit formed after dividing the construction work according to the professional process categories of the lighting power supply project. Each process node corresponds to a specific construction work category and an affiliated subcontracting team. Process nodes are interconnected through the sequential relationship of construction technology. The planned completion quantity and the actual completion quantity are respectively taken from the predetermined output value recorded in the construction organization design document and the output value obtained from the actual on-site statistics. Both are expressed in the same unit of measurement, so that the difference between the two has a clear physical meaning. In the case where the actual daily output rate is used as the divisor in the calculation, if a process node has no personnel or equipment input on the inspection date, resulting in zero actual output, the progress deviation data of that process node is no longer calculated according to the ratio method. Instead, the pre-set maximum number of delay days per day is directly taken as the progress deviation data of that node on that day. The progress deviation data is recalculated according to the ratio method after the node resumes actual input in the next statistical period, thereby avoiding the situation where the division by zero makes the calculation impossible.

[0016] Step S2: Based on the schedule deviation data and the shared working hours of resources between process nodes, construct a resource coupling propagation diagram to obtain the propagation influence degree of process nodes; Specifically, the resource coupling propagation graph is a weighted graph structure consisting of process nodes as nodes and resource sharing relationships between process nodes due to sharing the same construction team or equipment as edges. The weight of each edge is a composite of the resource sharing relationship between process nodes and the priority of the process nodes in the network plan. The propagation impact is a metric obtained by weighting the schedule deviation data of each process node through the aforementioned weighted edge relationships. Its unit of measurement is consistent with the schedule deviation data, both expressed in days. Therefore, the propagation impact and schedule deviation data can be directly added numerically without additional normalization or unit conversion. When there is no resource sharing time data between two process nodes, the edge weight between them is zero, and the edge does not participate in subsequent propagation calculations. When a process node has no resource sharing relationship with any other node, the node is treated as an isolated node in the resource coupling propagation graph, and its propagation impact value is directly equal to the node's own schedule deviation data, without adding propagation components from other nodes.

[0017] Step S3: Target process nodes are obtained by filtering based on the propagation impact, and candidate resource allocation schemes are obtained by filtering based on the shared working hours of resources associated with the target process nodes. Specifically, the selection of target process nodes is based on whether the propagation impact value of each process node exceeds a pre-set deviation handling threshold. This threshold is pre-set according to the total contract period and the number of key process nodes of the specific project. The more process nodes there are and the tighter the contract period, the smaller the threshold value should be, to reflect the differences in schedule tolerance among different projects. The selection of candidate resource allocation schemes involves removing process nodes whose propagation impact value has exceeded the pre-set deviation handling threshold from the set of process nodes that share resources with the target process node. Then, candidate resource donor nodes are determined from the remaining nodes based on their resource surplus, and candidate resource allocation schemes are formed accordingly. This removal operation avoids the situation where resources are drawn from nodes that are already lagging behind, thus causing a chain reaction of delays. If all process nodes that share resources with the target process node have been removed, resulting in an empty set of candidate resource allocation schemes, the schedule correction of the target process node is transferred to the manual review stage and is no longer automatically generated by subsequent steps.

[0018] Step S4: Substitute the candidate resource allocation schemes as disturbance data into the resource coupling propagation graph, and calculate the resource coupling propagation graph after the disturbance data is substituted using the propagation calculation algorithm to obtain the propagation impact degree after disturbance. Based on the comparison result of the maximum value of the propagation impact degree and the maximum value of the propagation impact degree after disturbance, the self-consistent resource allocation scheme is obtained by screening the candidate resource allocation schemes.

[0019] Specifically, the perturbation data is a new set of values ​​recalculated by substituting the resource transfer quantities recorded in the candidate resource allocation schemes into the resource availability quantities of the resource donor node and the target process node. This includes the perturbed resource availability quantity and the perturbed graph edge weights, which together constitute a structural modification to the resource coupling propagation graph. The maximum value of the propagation influence degree and the maximum value of the propagation influence degree after perturbation are both calculated by applying the same set of propagation operation rules to the resource coupling propagation graphs before and after the perturbation. Since they share the same unit of measurement and the same calculation path, they can be directly compared in terms of numerical magnitude without any inconsistency in units. A self-consistent resource allocation scheme refers to a candidate scheme in the resource coupling propagation graph where, after being substituted, the perturbed propagation influence degree of any process node in the graph does not exceed the maximum value of the propagation influence degree before the perturbation. If, after sequentially traversing all schemes in the candidate resource allocation scheme set, no scheme satisfying the above conditions is found, a prompt message indicating manual decision-making is output, and no candidate scheme is executed for the target process node, thus avoiding erroneous scheduling in cases where no self-consistent solution exists.

[0020] In one specific embodiment, step S1 includes: Based on the planned duration and total planned workload of each process node, the ratio of the total planned workload to the planned duration is calculated to obtain the planned daily output rate of the process node. Based on the inspection time and the planned daily output rate, the amount of work to be completed at the inspection time is calculated to obtain the planned completion amount of the process node. Based on the actual completed work volume data collected by the on-site terminal and the actual input resource data collected by the equipment terminal, the actual completed amount of the process node at the inspection time is determined, and the actual daily output rate of the process node is calculated based on the actual completed amount and the number of construction days corresponding to the inspection time. Based on the difference between the planned and actual output, the ratio of the difference to the actual daily output rate is calculated to obtain the progress deviation data of the process node.

[0021] Specifically, the planned total workload is taken from the predetermined workload value verified in the construction organization design document for that work process node. The planned duration is taken from the number of days from the start to the completion of that work process node as verified in the same document. The planned daily output rate obtained by dividing the two is expressed as the workload completed each day. The inspection point is the cumulative number of days calculated from the actual start date of that work process node, and the value is an integer not less than one. Multiplying the inspection point by the planned daily output rate, the resulting value is the workload that should be completed on the planned track by the inspection point. If the planned duration of that work process node is verified as zero days, it is determined that the node does not yet meet the calculation conditions, and no planned completion value is generated. The calculation will be performed after the planned duration data is completed.

[0022] The actual completed work volume data collected by the on-site terminals is the cumulative output value entered daily by on-site quality inspectors using the same unit of measurement as the planned total work volume. The actual resource input data collected by the equipment terminals is the number of man-hours or equipment shifts invested in the construction of that work node on that day. Both are used together to determine the actual completed volume, with the actual completed volume based on the cumulative output value entered by the on-site terminals. The data collected by the equipment terminals serves as the verification basis for confirming whether the actual completed volume matches the actual resources invested on that day. The number of construction days is taken from the cumulative calculation benchmark of the same time point as the inspection. The actual completed volume is divided by the number of construction days to obtain the actual daily output rate. If the number of construction days is zero, meaning that the node has not yet started, the actual daily output rate and schedule deviation data are not calculated until the actual work starts. When the actual daily output rate is not zero, the difference between the planned and actual output is divided by the actual daily output rate to obtain the schedule deviation data expressed in days. If the difference is negative, that is, the actual output exceeds the planned output, the schedule deviation data is also recorded as negative, indicating that the progress of this node is ahead rather than behind.

[0023] In one specific embodiment, step S2 includes: Based on the resource sharing time between process nodes and the total planned resources of each process node, the ratio of the sum of the resource sharing time and the total planned resources is calculated to obtain the resource contention weight between process nodes. Based on the total float data of the process nodes in the network plan, the reciprocal of the sum of the total float data and the preset constant is calculated to obtain the dependency strength coefficient between the process nodes. Using each process node as a graph node and the resource contention weight and dependency strength coefficient as edge weights, the graph nodes are connected to obtain the resource coupling propagation graph. The schedule deviation data, resource contention weights, and dependency strength coefficients are input into the propagation calculation algorithm to calculate the propagation impact of the process node.

[0024] Specifically, the shared working hours between process nodes refer to the actual working hours shared by two process nodes within the same statistical period for the same construction team or the same equipment. This value is obtained by daily accumulation of the team allocation ledgers recorded by the equipment terminal and the site terminal. The planned total resources for each process node are the total working hours required to complete all the work of that node as verified in the construction organization design document. The ratio obtained by dividing the shared working hours of two process nodes by the sum of their planned total resources is the resource contention weight. The larger the weight value, the higher the degree of mutual entanglement between the two nodes due to sharing the same resources. If there are no shared working hours records between two process nodes, i.e., the value is zero, the resource contention weight between them is directly set to zero, indicating that there is no resource coupling relationship between them. No connection edge is established in the resource coupling propagation graph, thereby avoiding the forced inclusion of nodes without resource associations into the propagation calculation. The total float data is taken from the number of free float days calculated for this process node in the network plan. The preset constant value is one. Its purpose is to avoid the denominator of the reciprocal operation being zero when the total float data is zero. The dependency strength coefficient is obtained by taking the reciprocal of the sum of the total float data and the preset constant. The smaller the total float data and the closer the dependency strength coefficient is to one, the smaller the float space of this node in the network plan and the higher the sensitivity to the progress changes of adjacent nodes.

[0025] Each process node is considered as a graph node in the resource coupling propagation graph. For any two process nodes with non-zero resource contention weights, the resource contention weight is multiplied by the dependency strength coefficient between them to obtain a composite weight. This composite weight is used as the edge weight connecting the two graph nodes. In this way, the two quantities that originally belonged to the resource occupancy dimension and the network planning dimension are unified into a single weight value on the same edge, which is used to represent the coupling strength between the two nodes determined by resource sharing and process acceptance relationship. For process nodes that do not have resource contention weights with any other process nodes, the node does not establish a connection edge with any other node in the resource coupling propagation graph and is treated as an isolated node. The propagation calculation uses the progress deviation data of each process node as the initial state value of that node. Along each edge connected to the node in the resource coupling propagation graph, the progress deviation data of the node at the other end of the edge is multiplied by the composite weight corresponding to that edge, and then accumulated one by one. The accumulated value is then added to the progress deviation data of the node itself to obtain the propagation influence degree of the process node. For isolated nodes, since there are no connected edges, their propagation influence degree is directly equal to the progress deviation data of the node itself, without adding the components of any other nodes.

[0026] Figure 2 This is a schematic diagram illustrating the propagation influence of each process node in the embodiments of this application. Figure 2 The illustration shows the propagation influence value composition of the three process nodes N4 distribution box cabinet, N5 lighting fixture installation, and N6 grounding device in this embodiment of the application. The propagation influence value of each process node is obtained by adding the progress deviation data of the node itself and the propagation superposition component propagated through the connected edges in the resource coupling propagation graph. Among them, the N5 lighting fixture installation is the propagation source node, and its propagation influence value is equal to its own progress deviation data and does not add the components of other nodes. The propagation influence values ​​of the two nodes, N4 distribution box cabinet installation and N6 grounding device construction, include not only their own progress deviation data, but also the propagation superposition component obtained by weighting the edge weights of the N5 lighting fixture installation in the resource coupling propagation graph. This demonstrates that the propagation calculation algorithm in this application transforms the originally independently calculated progress deviation data of each process node into a propagation influence value that can reflect the resource coupling relationship between nodes.

[0027] In one specific embodiment, step S3 includes: The propagation impact of each process node is compared with the preset deviation processing threshold, and the target process node is obtained from the process nodes whose propagation impact exceeds the preset deviation processing threshold. Based on the edges connected to the target process node in the resource coupling propagation graph, process nodes with resource contention weights are identified to obtain candidate resource donor nodes. Based on the total float data and dependency strength coefficient of each candidate resource donor node, resource donor nodes are selected from the candidate resource donor nodes; Based on the missing amount of work corresponding to the propagation impact of the target process node and the resource output efficiency of the resource supplier node, the amount of resources that need to be allocated to the resource supplier node is calculated to obtain candidate resource allocation schemes.

[0028] Specifically, the preset deviation handling threshold is pre-set based on the total contract period and the total number of process nodes of the specific project. The shorter the total contract period and the more process nodes, the smaller the threshold value, to reflect the limitation of the schedule compression degree on the schedule tolerance. The propagation impact of each process node is compared with the threshold one by one. Process nodes whose propagation impact value exceeds the threshold are determined as target process nodes, and process nodes that do not exceed the threshold are not processed as target process nodes. According to the edge relationships recorded in the resource coupling propagation graph, all edges connected to the target process node are traversed, and the process node corresponding to the other end of the edge is determined as a candidate resource donor node. If the target process node has no connected edges in the resource coupling propagation graph, that is, the node is an isolated node, then there is no candidate resource donor node, and the schedule correction of the target process node is transferred to the manual review stage.

[0029] In the case of candidate resource donor nodes, nodes whose own propagation impact exceeds the preset deviation handling threshold are first removed from the candidate resource donor node set to avoid extracting resources from nodes that are already lagging behind. Then, the remaining candidate resource donor nodes are sorted from largest to smallest total float data. The larger the total float data, the greater the progress fluctuation space of the node and the smaller the impact of extracting its resources on the node's own progress. For candidate resource donor nodes with the same total float data, they are further sorted from smallest to largest dependency strength coefficient. The smaller the dependency strength coefficient, the lower the coupling degree between the node and its neighboring nodes and the smaller the risk of cascading impact caused by extracting its resources. The candidate resource donor node ranked first in the sorting result is taken as the resource donor node. If the candidate resource donor node set is empty after removal, it is also transferred to the manual review stage. The missing workload of the target process node is the workload value obtained by multiplying the propagation impact value of the node by its planned daily output rate. It represents the amount of work that the node is short of completing according to the current progress deviation. The resource output efficiency of the resource supplier node is the average daily output value corresponding to the current actual unit resource input of the node. It is obtained by dividing the current actual daily output rate of the node by the current actual input resource quantity. Dividing the missing workload of the target process node by the resource output efficiency of the resource supplier node gives the amount of resources that the resource supplier node needs to allocate to support the target process node. If the current actual input resource quantity of the resource supplier node is zero, resulting in the inability to calculate the resource output efficiency, then the candidate resource supplier node will not participate in the current allocation quantity calculation. Instead, the next candidate resource supplier node in the ranking results will be selected for recalculation.

[0030] Figure 3 This is a schematic diagram illustrating the ranking criteria for candidate resource donor nodes in an embodiment of this application. Figure 3 This illustration shows the total float data and dependency strength coefficient values ​​for two candidate resource donor nodes, N4 distribution box and N6 grounding device, in this embodiment of the application. The total float data is taken from the number of free float days of the process node in the network plan, and the dependency strength coefficient is calculated by taking the reciprocal of the sum of the total float data of the node and a preset constant. In the figure, the total float data value of N6 grounding device is greater than that of N4 distribution box, and the dependency strength coefficient value is less than that of N4 distribution box. According to the screening rule in this embodiment of the application, which sorts the total float data from largest to smallest and then sorts the dependency strength coefficient from smallest to largest, N6 grounding device ranks first in the sorting results and is thus determined as a resource donor node. This demonstrates the specific judgment process in this application where the two criteria of total float data and dependency strength coefficient jointly determine the screening results of candidate resource donor nodes.

[0031] In one specific embodiment, step S4, which substitutes candidate resource allocation schemes as perturbation data into the resource coupling propagation graph, includes: Based on the resource quantity in the candidate resource allocation plan, the total planned resource quantity of the resource donor node is deducted to obtain the perturbed resource availability of the resource donor node. Based on the resource quantity in the candidate resource allocation scheme, the total planned resource quantity of the target process node is increased to obtain the perturbation resource availability of the target process node; Based on the perturbed resource availability of the resource donor node and the perturbed resource availability of the target process node, the resource contention weight in the resource coupling propagation graph is updated to obtain the perturbed resource contention weight. The perturbation data is determined by the perturbation data of the resource donor node, the perturbation data of the target process node, and the perturbation data of the resource contention weight. The perturbation data is then substituted into the resource coupling propagation graph to obtain the perturbation resource coupling propagation graph.

[0032] Specifically, the resource quantity recorded in the candidate resource allocation plan is the value of the resource quantity that the resource supplier node needs to allocate to support the target process node, calculated in the aforementioned steps. This value is deducted from the total planned resources of the resource supplier node to obtain the perturbation-free resource availability of the resource supplier node. If the value after deduction is less than zero, the candidate resource allocation plan is determined to be unexecutable and will not proceed to the subsequent perturbation calculation. Instead, the next candidate resource supplier node is selected to regenerate the candidate resource allocation plan. The same value is added to the total planned resources of the target process node to obtain the perturbation-free resource availability of the target process node. Based on the perturbed resource availability of the resource donor node and the target process node, the perturbed resource contention weight is recalculated using the same calculation method as before the perturbation: the shared resource time between the resource donor node and the target process node is divided by the sum of their perturbed resource availability. This method ensures that the weight values ​​obtained before and after the perturbation are under the same calculation caliber and can be compared. In the resource coupling propagation graph, except for the edge weights between the resource donor node and the target process node which are updated in the above manner, the edge weights and resource availability values ​​between other process nodes remain unchanged and are not involved in this perturbation. The perturbed resource availability of the resource donor node, the perturbed resource availability of the target process node, and the perturbed resource contention weight are substituted into the corresponding node attributes and edge weight positions in the original resource coupling propagation graph, replacing the original values. The remaining graph nodes and edge structures remain unchanged, thus obtaining the perturbed resource coupling propagation graph, which serves as the input structure for subsequent recalculation of the propagation impact.

[0033] In one specific embodiment, step S4 involves calculating the resource coupling propagation graph after incorporating the disturbance data using a propagation calculation algorithm to obtain the propagation impact degree after the disturbance, including: The actual daily output rate of the resource donor node after the disturbance is calculated based on the available resources after the disturbance. The output gap of the resource supplier node is calculated based on the difference between the planned daily output rate and the actual daily output rate after the disturbance of the resource supplier node. The progress deviation data of the resource supplier node after the disturbance is obtained by calculating the ratio of the output gap to the actual daily output rate after the disturbance. Based on the available resources after the disturbance of the target process node, the actual daily output rate of the target process node after the disturbance is calculated, and the schedule deviation data of the target process node after the disturbance is obtained by calculating the ratio of the missing work quantity of the target process node to the actual daily output rate after the disturbance. The perturbation-induced schedule deviation data of the resource donor node, the perturbation-induced schedule deviation data of the target process node, and the perturbation-induced resource contention weight are input into the propagation calculation algorithm to perform propagation calculation and obtain the perturbation-induced propagation impact degree of the process node.

[0034] Specifically, the actual daily output rate of a resource donor node after disturbance is obtained by multiplying the node's available resources after disturbance by its resource output efficiency. The resource output efficiency is the average daily output value corresponding to the current actual unit of resources invested by the node, given by the ratio of the node's actual daily output rate to the actual amount of resources invested, which was determined in the previous steps. Subtracting the node's planned daily output rate from the actual daily output rate after disturbance yields the node's output gap. A positive output gap indicates that the node's output capacity is lower than the planned level due to resource allocation. Dividing the output gap by the node's actual daily output rate after disturbance yields the progress deviation data after disturbance, expressed in days. If the node's available resources drop to zero after disturbance, resulting in the actual daily output rate also being zero, the candidate resource allocation scheme is deemed unexecutable, and the current calculation is discontinued. Instead, the next candidate resource donor node is selected to regenerate the candidate resource allocation scheme.

[0035] The actual daily output rate of the target process node after the disturbance is also obtained by multiplying the available resources of the node after the disturbance by the node's own resource output efficiency. The resource output efficiency of the node is given by the ratio of the actual daily output rate of the node before the disturbance to the actual amount of resources invested before the disturbance. Each resource donor node uses its own resource output efficiency and they do not mix them. Dividing the shortfall of the target process node by the actual daily output rate after the disturbance yields the schedule deviation data of the target process node after the disturbance. The post-disturbance schedule deviation data of the resource donor node and the target process node are substituted into the original schedule deviation data positions of the corresponding nodes in the resource coupling propagation graph, replacing the original values. The schedule deviation data of other process nodes not involved in this allocation remain unchanged. Then, the same calculation method as before the disturbance propagation is used, that is, the schedule deviation data of each process node is used as the initial state value, and the values ​​of adjacent nodes are weighted and accumulated along the updated edge weights and then added to the value of the node itself. This calculation is repeated for all process nodes in the graph to obtain the post-disturbance propagation impact degree of each process node. The values ​​of the resource donor node and the target process node have changed because their own schedule deviation data and the weights of the connected edges have been updated. If the other process nodes not directly involved in the allocation have connected edges with the aforementioned two nodes, their post-disturbance propagation impact degree will also change accordingly. If there are no connected edges, the post-disturbance propagation impact degree of the node remains unchanged.

[0036] In one specific embodiment, step S4 involves comparing the maximum value of the propagation impact with the maximum value of the propagation impact after the disturbance, and then selecting a self-consistent resource allocation scheme from the candidate resource allocation schemes. This includes: The propagation impact of each process node is compared to obtain the maximum propagation impact. The impact of disturbance propagation at each process node is compared to obtain the maximum impact of disturbance propagation. The maximum value of the propagation impact after the disturbance is compared with the maximum value of the propagation impact. If the maximum value of the propagation impact after the disturbance is not greater than the maximum value of the propagation impact, the candidate resource allocation scheme is determined as a self-consistent resource allocation scheme. If the maximum value of the propagation impact after the disturbance is greater than the maximum value of the propagation impact, the next candidate resource allocation scheme is selected from the candidate resource allocation schemes. The next candidate resource allocation scheme is then substituted into the resource coupling propagation graph for repeated calculation and comparison until a self-consistent resource allocation scheme is obtained.

[0037] Specifically, the maximum propagation impact value is taken from the largest of the propagation impact values ​​of all process nodes in the resource coupling propagation graph. The maximum propagation impact value after disturbance is taken from the largest of the post-disturbance propagation impact values ​​of the same group of process nodes in the post-disturbance resource coupling propagation graph. Both are obtained by applying the same propagation calculation rules from the aforementioned steps to the graph structures before and after the disturbance. The range of process nodes involved and the unit of measurement are consistent, so the two are comparable and can be directly compared in terms of numerical magnitude without additional conversion. Subtracting the maximum propagation impact value after disturbance from the maximum propagation impact value, if the difference is not greater than zero, that is, the maximum propagation impact value after disturbance is not greater than the maximum propagation impact value, it is determined that the current candidate resource allocation scheme will not cause a more severe lag than before the disturbance at any process node in the resource coupling propagation graph. The candidate resource allocation scheme is then determined as a self-consistent resource allocation scheme and is no longer screened.

[0038] If the difference is greater than zero, meaning the maximum propagation impact after the disturbance is greater than the maximum propagation impact, the current candidate resource allocation plan is determined to cause a new and more severe lag and is therefore rejected. Instead, in the previous candidate resource allocation plan generation step, the candidate resource donor nodes are sorted from largest to smallest total float data and smallest to largest dependency strength coefficient. The next candidate resource donor node whose sorted position is immediately adjacent to the candidate resource donor node corresponding to the currently rejected plan is selected. Based on this, the amount of resources that need to be allocated to this candidate resource donor node is recalculated, and the next candidate resource allocation plan is generated. The next candidate resource allocation is then performed. The plan re-executes all steps of resource availability deduction and increase, resource contention weight update, calculation of actual daily output rate and schedule deviation after disturbance, and calculation of the propagation impact after disturbance. Then, the newly obtained maximum propagation impact after disturbance is compared with the maximum propagation impact. This process is repeated until a candidate resource allocation plan meets the self-consistency condition. If all candidate plans in the candidate resource donor node ranking results have been traversed and no self-consistent resource allocation plan that meets the condition has been obtained, a prompt message to transfer to manual decision-making is output, and no candidate resource allocation plan is executed for the target process node.

[0039] The above describes the method for controlling the construction progress of lighting power supply projects in the embodiments of this application. The following describes the system for controlling the construction progress of lighting power supply projects in the embodiments of this application. One embodiment of the system for controlling the construction progress of lighting power supply projects in the embodiments of this application includes: The calculation module is used to obtain the progress deviation data of the process node based on the difference between the planned completion amount and the actual completion amount of the process node; The module is used to construct a resource coupling propagation graph based on the schedule deviation data and the shared working hours between the process nodes, and to obtain the propagation influence degree of the process nodes; The filtering module is used to filter target process nodes by the propagation impact degree and to filter candidate resource allocation schemes by the shared working hours associated with the target process nodes. The comparison module is used to substitute the candidate resource allocation schemes as perturbation data into the resource coupling propagation graph, calculate the resource coupling propagation graph after substituting the perturbation data using a propagation calculation algorithm, obtain the propagation impact degree after perturbation, and obtain a self-consistent resource allocation scheme by screening the candidate resource allocation schemes based on the comparison result between the maximum value of the propagation impact degree and the maximum value of the propagation impact degree after perturbation.

[0040] This invention also provides a lighting power supply project construction progress control device, which can be a server. The device includes a processor, memory, display screen, input device, network interface, and database connected via a system bus. The processor, designed as a computer, provides computing and control capabilities. The memory includes a non-volatile storage medium and internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The database stores the data corresponding to this embodiment. The network interface communicates with external terminals via a network connection. When the computer program is executed by the processor, it implements the above-described method.

[0041] The present invention also provides a computer-readable storage medium, which can be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium, wherein the computer-readable storage medium stores instructions that, when the instructions are executed on a computer, cause the computer to perform the steps of the lighting power supply project construction progress control method.

[0042] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0043] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a lighting power supply engineering construction progress control device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0044] The above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit it. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for controlling the construction progress of a lighting power supply project, characterized in that, The method includes: Step S1: Obtain the progress deviation data of the process node based on the difference between the planned completion amount and the actual completion amount of the process node; Step S2: Based on the schedule deviation data and the shared working hours of resources between the process nodes, construct a resource coupling propagation diagram to obtain the propagation influence degree of the process nodes; Step S3: Target process nodes are obtained by filtering based on the propagation impact degree, and candidate resource allocation schemes are obtained by filtering based on the shared working hours associated with the target process nodes. Step S4: Substitute the candidate resource allocation scheme as perturbation data into the resource coupling propagation graph, and calculate the resource coupling propagation graph after substituting the perturbation data using a propagation calculation algorithm to obtain the propagation impact degree after perturbation. Based on the comparison result between the maximum value of the propagation impact degree and the maximum value of the propagation impact degree after perturbation, a self-consistent resource allocation scheme is obtained by screening the candidate resource allocation schemes.

2. The method for controlling the construction progress of lighting power supply projects according to claim 1, characterized in that, Step S1 includes: Based on the planned duration and planned total workload of the process node, the ratio of the planned total workload to the planned duration is calculated to obtain the planned daily output rate of the process node. Based on the inspection time and the planned daily output rate, the amount of work that the process node should complete at the inspection time is calculated to obtain the planned completion amount of the process node; Based on the actual completed work volume data collected by the on-site terminal and the actual invested resource data collected by the equipment terminal, the actual completed amount of the process node at the inspection time is determined, and the actual daily output rate of the process node is calculated based on the actual completed amount and the number of construction days corresponding to the inspection time, so as to obtain the actual daily output rate of the process node. Based on the difference between the planned completion amount and the actual completion amount, the ratio of the difference to the actual daily output rate is calculated to obtain the progress deviation data of the process node.

3. The method for controlling the construction progress of lighting power supply projects according to claim 2, characterized in that, Step S2 includes: Based on the resource-sharing time between the process nodes and the total planned resources of each process node, the ratio of the resource-sharing time to the sum of the total planned resources is calculated to obtain the resource contention weight between the process nodes. Based on the total float data of the process nodes in the network plan, the reciprocal of the sum of the total float data and a preset constant is calculated to obtain the dependency strength coefficient between the process nodes. Using each process node as a graph node and the resource contention weight and the dependency strength coefficient as edge weights, the graph nodes are connected to obtain the resource coupling propagation graph. The schedule deviation data, the resource contention weight, and the dependency strength coefficient are input into the propagation calculation algorithm to perform propagation calculations and obtain the propagation influence degree of the process node.

4. The method for controlling the construction progress of lighting power supply projects according to claim 3, characterized in that, Step S3 includes: The propagation influence degree of each process node is compared with a preset deviation processing threshold, and the target process node is obtained by filtering the process nodes whose propagation influence degree exceeds the preset deviation processing threshold; Based on the edges connected to the target process node in the resource coupling propagation graph, process nodes with the resource contention weight are determined to obtain candidate resource donor nodes; Based on the total float data and the dependency strength coefficient of each candidate resource donor node, a resource donor node is selected from the candidate resource donor nodes; Based on the missing amount of work corresponding to the propagation influence degree of the target process node and the resource output efficiency of the resource supplier node, the amount of resources that the resource supplier node needs to allocate is calculated to obtain a candidate resource allocation scheme.

5. The method for controlling the construction progress of lighting power supply projects according to claim 4, characterized in that, Step S4, which substitutes the candidate resource allocation scheme as perturbation data into the resource coupling propagation graph, includes: Based on the resource quantity in the candidate resource allocation scheme, the planned total resource quantity of the resource donor node is deducted to obtain the disturbed resource availability of the resource donor node; Based on the resource quantity in the candidate resource allocation scheme, the total planned resource quantity of the target process node is increased to obtain the perturbation resource availability of the target process node; Based on the perturbed resource availability of the resource donor node and the perturbed resource availability of the target process node, the resource contention weight in the resource coupling propagation graph is updated to obtain the perturbed resource contention weight. The perturbation data is determined by the perturbation data of the resource donor node, the perturbation data of the target process node, and the perturbation data of the resource contention weight. The perturbation data is then substituted into the resource coupling propagation graph to obtain the perturbation resource coupling propagation graph.

6. The method for controlling the construction progress of lighting power supply projects according to claim 5, characterized in that, In step S4, the resource coupling propagation graph after the disturbance data is substituted is calculated using a propagation calculation algorithm to obtain the propagation impact degree after the disturbance, including: The actual daily output rate of the resource donor node after the disturbance is calculated based on the resource availability of the resource donor node after the disturbance. Based on the difference between the planned daily output rate of the resource supplier node and the actual daily output rate of the resource supplier node after disturbance, the output gap of the resource supplier node is calculated, and based on the ratio of the output gap to the actual daily output rate after disturbance, the progress deviation data of the resource supplier node after disturbance is obtained. Based on the available resources of the target process node after the disturbance, the actual daily output rate of the target process node after the disturbance is calculated, and the progress deviation data of the target process node after the disturbance is obtained by calculating the ratio of the missing work quantity of the target process node to the actual daily output rate after the disturbance. The perturbation-induced schedule deviation data of the resource donor node, the perturbation-induced schedule deviation data of the target process node, and the perturbation-induced resource contention weight are input into the propagation calculation algorithm to perform propagation calculation, thereby obtaining the perturbation-induced propagation impact degree of the process node.

7. The method for controlling the construction progress of lighting power supply projects according to claim 6, characterized in that, In step S4, a self-consistent resource allocation scheme is obtained by comparing the maximum value of the propagation impact with the maximum value of the propagation impact after the disturbance, based on the candidate resource allocation schemes. This includes: The propagation influence of each process node is compared to obtain the maximum propagation influence. The impact degree of the disturbance propagation after each process node is compared to obtain the maximum value of the impact degree of the disturbance propagation after the process node. The maximum value of the propagation impact after the disturbance is compared with the maximum value of the propagation impact. If the maximum value of the propagation impact after the disturbance is not greater than the maximum value of the propagation impact, the candidate resource allocation scheme is determined as a self-consistent resource allocation scheme. If the maximum value of the propagation impact after the disturbance is greater than the maximum value of the propagation impact, the next candidate resource allocation scheme is selected from the candidate resource allocation schemes, and the next candidate resource allocation scheme is substituted into the resource coupling propagation graph for repeated calculation and comparison until the self-consistent resource allocation scheme is obtained.

8. A construction progress control system for lighting power supply projects, characterized in that, For implementing the method for controlling the construction progress of lighting power supply projects as described in any one of claims 1-7, the lighting power supply project construction progress control system comprises: The calculation module is used to obtain the progress deviation data of the process node based on the difference between the planned completion amount and the actual completion amount of the process node; The module is used to construct a resource coupling propagation graph based on the schedule deviation data and the shared working hours between the process nodes, and to obtain the propagation influence degree of the process nodes; The filtering module is used to filter target process nodes by the propagation impact degree and to filter candidate resource allocation schemes by the shared working hours associated with the target process nodes. The comparison module is used to substitute the candidate resource allocation schemes as perturbation data into the resource coupling propagation graph, calculate the resource coupling propagation graph after substituting the perturbation data using a propagation calculation algorithm, obtain the propagation impact degree after perturbation, and obtain a self-consistent resource allocation scheme by screening the candidate resource allocation schemes based on the comparison result between the maximum value of the propagation impact degree and the maximum value of the propagation impact degree after perturbation.

9. A device for controlling the construction progress of a lighting power supply project, characterized in that, The method includes a memory and a processor, wherein the memory stores a computer program that can run on the processor, and the processor executes the computer program to implement the method for controlling the construction progress of lighting power supply projects as described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is run by the processor, it causes the processor to execute the lighting power supply project construction progress control method as described in any one of claims 1 to 7.

Images