A rapid construction method, device and medium based on BOM relationship tree
By adopting a BOM construction solution based on the optimization breadth priority algorithm in the ERP system, the problem of inefficient BOM structure construction in the ERP system is solved, and the efficiency and quality of cost management are improved.
Patent Information
- Application Number
- CN202410125091.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-01-29
- Publication Date
- 2025-02-25
- Estimated Expiration
- 2044-01-29
AI Technical Summary
The BOM structure construction efficiency in the existing ERP system is inefficient, which seriously slows down the calculation speed of accounting costs and affects the user experience.
Using the BOM construction solution based on the optimized breadth priority algorithm (BFS), the BOM structure is quickly constructed through hierarchical query processing and repetitive judgment to avoid the problem of insufficient verification.
The processing performance is greatly optimized, the efficiency and quality of enterprise cost management is improved, and the efficiency and performance are taken into account, the time complexity is optimized, and the server resource occupation is reduced.
Smart Images

Figure CN118012867B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of ERP enterprise management software, and in particular to a rapid construction method, device and medium based on a BOM relationship tree. Background Art
[0002] ERP standard products cover various industries. Different companies have different management and business. There are often many layers of BOM in the manufacturing process. For example, raw materials produce parts, parts produce components, and components are assembled into finished products. In the cost calculation process, the BOM structure is built according to the use relationship of parts, and then convolution calculations are performed from bottom to top. The construction of the BOM structure is directly related to the performance of cost calculation and user experience, which puts forward high requirements on how to quickly and accurately build the BOM structure.
[0003] At present, when the ERP system calculates costs and builds the BOM structure, it adopts a solution based on the depth-first algorithm, that is, taking a certain BOM as the vertex, when finding its subordinate BOM, randomly select a subordinate BOM, and then find the BOM used by the subordinate BOM, and so on. After traversing one branch, traverse another branch until the entire BOM structure is built. In addition to realizing the construction of the BOM structure, another important function of this solution is to check whether there are repeated BOMs on each branch. If there are repeated BOMs, there will be a circular use. However, the existing processing solutions are inefficient when building a more complex BOM structure, which seriously slows down the speed of cost calculation and affects the user experience. Summary of the invention
[0004] The embodiments of the present application provide a rapid construction method, device and medium based on a BOM relationship tree, which are used to solve the following technical problems: the construction efficiency of the BOM structure in the existing ERP system is low, which seriously slows down the calculation speed of the accounting cost and easily affects the user experience.
[0005] The present application embodiment adopts the following technical solutions:
[0006] On the one hand, an embodiment of the present application provides a rapid construction method based on a BOM relationship tree, including: performing hierarchical query processing on BOM nodes under all levels according to the requisition relationship in the ERP system to determine the top-level BOM node; through the requisition relationship, querying the lower-level BOM nodes of the top-level BOM node to obtain the lower-level branch information of the top-level BOM node; performing repeatability judgment on the lower-level branch information regarding the BOM level to determine the first result information of the BOM level; based on the first result information, performing existence judgment on the lower-level branch information regarding the BOM level to determine the second result information.
[0007] The embodiment of the present application can avoid some problems of inaccurate verification in the process of building the BOM structure through a BOM building solution based on an optimized breadth-first algorithm (BFS), thereby greatly optimizing the processing performance and effectively improving the efficiency and quality of enterprise cost management. At the same time, it takes into account the characteristics of high efficiency and good performance, and also optimizes the time complexity. And it takes up less server resources. It also supports the validity verification of the BOM during the construction process and supports the verification method for the situation of cyclic use.
[0008] In a feasible implementation, based on the requisition relationship in the ERP system, hierarchical query processing is performed on the BOM nodes under all levels to determine the top-level BOM node, specifically including: through the requisition relationship, all BOM nodes are screened for upper and lower levels between each level to determine the top-level BOM among all the BOM nodes; wherein the top-level BOM is a BOM node that is not requisitioned by other BOM nodes; extracting the mapping relationship between the top-level BOM and the corresponding lower-level BOM nodes; based on the mapping relationship and through an array list, determining the top-level BOM node from each BOM node in the top-level BOM.
[0009] In a feasible implementation, the lower-level BOM nodes of the top-level BOM node are queried and processed through the requisition relationship to obtain the lower-level branch information of the top-level BOM node, specifically including: through the requisition relationship, the lower-level BOM nodes corresponding to the top-level BOM node are queried and processed to obtain the secondary BOM node; according to the mapping relationship between the top-level BOM node and the secondary BOM node, the secondary BOM node is added to the array list of the top-level BOM node; through the array list, the top-level BOM node and the secondary BOM node are combined and processed to obtain the lower-level branch information; wherein, the lower-level branch information is the branch information of each BOM node from the top-level BOM node to the secondary BOM node.
[0010] In a feasible implementation, the repeatability of the BOM level is judged on the lower-level branch information to determine the first result information of the BOM level, which specifically includes: if there is a repeated BOM level in the lower-level branch information, then each BOM node corresponding to the repeated BOM level is stopped, and a loop requisition stop information based on the repeated BOM level is generated; if there is no repeated BOM level in the lower-level branch information, then each BOM node corresponding to the repeated BOM level is queried about the requisition relationship, and a loop requisition execution information is generated; wherein, the first result information includes the loop requisition stop information and the loop requisition execution information.
[0011] In a feasible implementation, based on the first result information, the existence of the BOM level is judged on the lower-level branch information to determine the second result information, specifically including: if the first result information is cyclic requisition execution information, the existence of the lower-level BOM node is judged on the step-by-step BOM node in the lower-level branch information; wherein the lower-level BOM node is the lower-level node of each BOM node in the step-by-step BOM node; if there is a blank BOM node in the lower-level BOM node, the BOM structure in the ERP system completes the construction operation and generates BOM construction completion information; if there is no blank BOM node in the lower-level BOM node, the lower-level BOM node is queried about the requisition relationship and generates query execution information; wherein the second result information includes the BOM construction completion information and the query execution information.
[0012] In a feasible implementation, after the existence of the BOM level is judged on the lower-level branch information based on the first result information and the second result information is determined, it specifically includes: determining the BOM node corresponding to the query execution information in the second result information as the current-level BOM node; if the query execution information is identified, querying and processing the lower-level BOM nodes of the current-level BOM node through the requisition relationship to obtain the current lower-level branch information of the current-level BOM node; performing repeatability and existence judgments on the current lower-level branch information regarding the BOM level, until the BOM structure in the ERP system completes the construction operation and generates BOM construction completion information.
[0013] In a feasible implementation, the BOM structure in the ERP system completes the construction operation, specifically including: traversing each lower-level branch information in the ERP system through a preset breadth-first algorithm, and constructing a complete BOM structure based on the judgment operations in the first result information and the second result information.
[0014] In a feasible implementation manner, the query processing method of the lower-level BOM nodes is to perform a one-by-one query processing on each lower-level BOM node.
[0015] In the second aspect, an embodiment of the present application also provides a rapid construction device based on a BOM relationship tree, the device comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions that can be executed by the at least one processor, so that the at least one processor can execute a rapid construction method based on a BOM relationship tree as described in any of the above embodiments.
[0016] In the third aspect, an embodiment of the present application also provides a non-volatile computer storage medium, characterized in that the storage medium is a non-volatile computer-readable storage medium, and the non-volatile computer-readable storage medium stores at least one program, each of which includes instructions, and when the instructions are executed by the terminal, the terminal executes a rapid construction method based on a BOM relationship tree described in any of the above-mentioned embodiments.
[0017] The present application provides a method, device and medium for rapid construction based on the BOM relationship tree. Through the BOM construction scheme based on the optimized breadth-first algorithm (BFS), some problems of inaccurate verification can be avoided in the process of building the BOM structure, thereby greatly optimizing the processing performance and effectively improving the efficiency and quality of enterprise cost management. At the same time, it takes into account the characteristics of high efficiency and good performance, and optimizes the time complexity. And it takes up less server resources. It also supports the validity verification of BOM during the construction process and supports the verification method for the situation of cyclic use. BRIEF DESCRIPTION OF THE DRAWINGS
[0018] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. In the drawings:
[0019] Figure 1 A flowchart of a rapid construction method based on a BOM relationship tree provided in an embodiment of the present application;
[0020] Figure 2 A schematic diagram of a construction framework based on a BOM relationship tree provided in an embodiment of the present application;
[0021] Figure 3 A structural schematic diagram of a rapid construction device based on a BOM relationship tree provided in an embodiment of the present application. DETAILED DESCRIPTION
[0022] In order to enable those skilled in the art to better understand the technical solutions in this application, the technical solutions in the embodiments of this application will be clearly and completely described below in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are only part of the embodiments of this application, not all of them. Based on the embodiments of this specification, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of this application.
[0023] The present application embodiment provides a rapid construction method based on the BOM relationship tree, such as Figure 1 As shown, the rapid construction method based on the BOM relationship tree specifically includes steps S101-S104:
[0024] S101. According to the requisition relationship in the ERP system, hierarchical query processing is performed on BOM nodes under all hierarchies to determine the top-level BOM node.
[0025] Specifically, through the use relationship, all BOM nodes are screened for use between upper and lower levels at each level to determine the top BOM among all BOM nodes. The top BOM is a BOM node that is not used by other BOM nodes.
[0026] Furthermore, the mapping relationship between the top-level BOM and the corresponding lower-level BOM nodes is extracted.
[0027] Furthermore, based on the mapping relationship and through the array list, each BOM node in the top-level BOM is determined to be a top-level BOM node.
[0028] In one embodiment, Figure 2 A schematic diagram of a construction framework based on a BOM relationship tree is provided in an embodiment of the present application, such as Figure 2 As shown, first, all top-level BOMs are found at once through the use relationship. The top-level BOM that is not used by other BOMs is the top-level BOM. The top-level BOM is located at level 1, and the mapping relationship between the current level and the level containing the BOM nodes is recorded. At the same time, an array list is used to record all top-level BOM nodes at the current level.
[0029] S102, querying and processing the lower-level BOM nodes of the top-level BOM node through the requisition relationship to obtain the lower-level branch information of the top-level BOM node, wherein the query processing method of the lower-level BOM node is to traverse and query each lower-level BOM node one by one.
[0030] Specifically, through the requisition relationship, the lower-level BOM nodes corresponding to the top-level BOM nodes are queried and processed to obtain the second-level BOM nodes.
[0031] Further, according to the mapping relationship between the top-level BOM node and the second-level BOM node, the second-level BOM node is added to the array list of the top-level BOM node.
[0032] Furthermore, the top-level BOM node and the sub-level BOM node are combined and processed through the array list to obtain the lower-level branch information, wherein the lower-level branch information is the branch information of each BOM node from the top-level BOM node to the sub-level BOM node.
[0033] In one embodiment, Figure 2As shown, the requisition relationship in the ERP system is used again, and then all the subordinate BOMs requisitioned by the superior BOM are found at one time. The level to which the subordinate BOM belongs is the superior BOM level + 1, and the mapping relationship between the level and the contained BOM nodes is recorded. Through the corresponding relationship between the superior and inferior BOM nodes, the subordinate BOM node is added to the back of the superior BOM node (top-level BOM node) in the array list, thus forming the lower-level branch information composed of the BOM nodes from the top level to the layer, that is, the branch information of each BOM node from the top-level BOM node to the sub-level BOM node.
[0034] S103: Perform a repeatability judgment on the BOM level on the lower-level branch information to determine the first result information of the BOM level.
[0035] Specifically, if there are repeated BOM levels in the lower-level branch information, each BOM node corresponding to the repeated BOM level is stopped, and the cyclic use stop information based on the repeated BOM level is generated.
[0036] If there is no repeated BOM level in the lower branch information, the relevant requisition relationship will be queried for each BOM node corresponding to the repeated BOM level, and cyclic requisition execution information will be generated.
[0037] The first result information includes cyclical collection stop information and cyclical collection execution information.
[0038] In one embodiment, Figure 2 As shown, if there are repeated BOM levels in the lower branch information, that is, repeated BOMs appear on a branch, then the BOM nodes in the branch will have a circular requisition situation, and then the circular requisition will be terminated and the circular requisition stop information will be generated. Otherwise, the query processing of the relevant requisition relationship of each BOM node will continue.
[0039] S104. Based on the first result information, determine the existence of the BOM level on the lower-level branch information to determine the second result information.
[0040] Specifically, if the first result information is the loop-requisition execution information, the existence of the lower-level BOM node is determined for the level-by-level BOM node in the lower-level branch information, wherein the lower-level BOM node is the lower-level node of each BOM node in the level-by-level BOM node.
[0041] If there is a blank BOM node in the lower-level BOM node, the BOM structure in the ERP system completes the construction operation and generates BOM construction completion information.
[0042] If there is no blank BOM node in the lower-level BOM node, query processing on the lower-level BOM node related to the requisition relationship is performed, and query execution information is generated. The second result information includes BOM construction completion information and query execution information.
[0043] In one embodiment, Figure 2 As shown, when there are no duplicate BOM nodes in the lower-level branch information, continue to search for all lower-level BOMs through the requisition relationship, and then judge the existence of lower-level BOM nodes for the level-by-level BOM nodes in the lower-level branch information, that is, whether there are blank nodes in the lower-level BOM nodes. If there are blank nodes, the BOM construction is completed and the complete BOM structure is obtained.
[0044] Further, after the second result information is determined, the BOM node corresponding to the query execution information in the second result information is determined as the current layer BOM node.
[0045] If the query execution information is identified, the subordinate BOM nodes of the current layer BOM node are queried through the requisition relationship to obtain the current lower layer branch information of the current layer BOM node.
[0046] Furthermore, the current lower-level branch information is subjected to a repetitive judgment and an existence judgment on the BOM level until the BOM structure in the ERP system completes the construction operation and generates BOM construction completion information. The BOM structure completion operation may be: traversing each lower-level branch information in the ERP system through a preset breadth-first algorithm, and constructing a complete BOM structure based on the judgment operation in the first result information and the second result information.
[0047] In one implementation, Figure 2 As shown, if the BOM node corresponding to the query execution information still has a lower-level BOM node, the current-level BOM node will continue to perform the repetitiveness judgment and existence judgment on the relevant BOM level, that is, the above-mentioned repetitiveness judgment and existence judgment will be repeated on the lower-level branch information of the current-level BOM node until the complete BOM structure is constructed or the execution loop is terminated.
[0048] In one embodiment, a branch has 4 layers of BOM nodes (1st layer: A, 2nd layer: B, C, 3rd layer: D, E, F and 4th layer: H, A); when traversing to the top BOM, there is only one branch A, which is put into the data group list; when traversing to the 2nd layer, the list becomes two branches A->B and A->C; when traversing to the 3rd layer, the list becomes three branches A->B->D, A->B->E and A->C->F; when traversing to the 4th layer, the list becomes two branches A->B->D->H and A->C->F->A. A duplicate BOM: A appears on the branch A->C->F->A, indicating that the BOM called by the loop is found, and the loop withdrawal stop operation is performed.
[0049] In addition, the embodiment of the present application also provides a rapid construction device based on the BOM relationship tree, such as Figure 3 As shown, the rapid construction device 300 based on the BOM relationship tree specifically includes:
[0050] At least one processor 301. And a memory 302 in communication with the at least one processor 301. The memory 302 stores instructions that can be executed by the at least one processor 301, so that the at least one processor 301 can execute:
[0051] According to the requisition relationship in the ERP system, perform hierarchical query processing on BOM nodes at all levels to determine the top-level BOM node;
[0052] Through the use relationship, query and process the lower-level BOM nodes of the top-level BOM node to obtain the lower-level branch information of the top-level BOM node;
[0053] Perform repetitive judgment on the BOM level for the lower-level branch information, and determine the first result information of the BOM level;
[0054] Based on the first result information, the existence of the BOM level is judged on the lower-level branch information to determine the second result information.
[0055] The present application provides a method and device for rapid construction based on a BOM relationship tree. Through a BOM construction scheme based on an optimized breadth-first algorithm (BFS), some problems of inaccurate verification can be avoided during the construction of the BOM structure, thereby greatly optimizing the processing performance and effectively improving the efficiency and quality of enterprise cost management. At the same time, it takes into account the characteristics of high efficiency and good performance, and optimizes the time complexity. And it takes up less server resources. It also supports the validity verification of the BOM during the construction process and supports the verification method for the situation of circular use.
[0056] Each embodiment in this application is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the device and medium embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiments.
[0057] The devices and media provided in the embodiments of the present application correspond one-to-one to the methods. Therefore, the devices and media also have similar beneficial technical effects as the corresponding methods. Since the beneficial technical effects of the methods have been described in detail above, the beneficial technical effects of the devices and media will not be repeated here.
[0058] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0059] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0060] These computer program instructions may also be stored in a computer readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0061] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0062] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.
[0063] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.
[0064] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.
[0065] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0066] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims
1. A rapid construction method based on BOM relationship tree, characterized in that: The method comprises: According to the requisition relationship in the ERP system, perform hierarchical query processing on BOM nodes at all levels to determine the top-level BOM node; Through the requisition relationship, query and process the lower-level BOM nodes of the top-level BOM node to obtain the lower-level branch information of the top-level BOM node; Performing a repetitive judgment on the BOM level on the lower-level branch information to determine first result information of the BOM level; Based on the first result information, determining the existence of the BOM level on the lower-layer branch information to determine the second result information specifically includes: If the first result information is loop-requisition execution information, then the existence of a lower-level BOM node is determined for the level-by-level BOM node in the lower-level branch information; wherein the lower-level BOM node is a lower-level node of each BOM node in the level-by-level BOM node; If there is a blank BOM node in the lower-level BOM node, the BOM structure in the ERP system completes the construction operation and generates BOM construction completion information; If there is no blank BOM node in the lower-level BOM node, query processing related to the requisition relationship is performed on the lower-level BOM node, and query execution information is generated; Wherein, the second result information includes the BOM building completion information and the query execution information; Determine the BOM node corresponding to the query execution information in the second result information as the current layer BOM node; If the query execution information is identified, query processing is performed on the lower-level BOM nodes of the current-level BOM node through the requisition relationship to obtain the current lower-level branch information of the current-level BOM node; The current lower-level branch information is subjected to a repetitiveness judgment and an existence judgment on the BOM level until the BOM structure in the ERP system completes the construction operation and generates BOM construction completion information.
2. According to claim 1, a rapid construction method based on BOM relationship tree is characterized in that: According to the requisition relationship in the ERP system, hierarchical query processing is performed on BOM nodes at all levels to determine the top-level BOM node, including: Through the use relationship, all BOM nodes are screened for use between upper and lower levels at each level, and the top-level BOM among all BOM nodes is determined; wherein the top-level BOM is a BOM node that is not used by other BOM nodes; Extract the mapping relationship between the top-level BOM and the corresponding lower-level BOM nodes; Based on the mapping relationship and through an array list, each BOM node in the top-level BOM is used to determine the top-level BOM node.
3. The rapid construction method based on BOM relationship tree according to claim 1 is characterized in that: Through the requisition relationship, query processing is performed on the lower-level BOM nodes of the top-level BOM node to obtain the lower-level branch information of the top-level BOM node, specifically including: Through the requisition relationship, query and process the lower-level BOM node corresponding to the top-level BOM node to obtain the secondary-level BOM node; According to the mapping relationship between the top-level BOM node and the sub-level BOM node, the sub-level BOM node is added to the array list of the top-level BOM node; The top-level BOM node and the sub-level BOM node are combined and processed through the array list to obtain the lower-level branch information; wherein the lower-level branch information is the branch information of each BOM node from the top-level BOM node to the sub-level BOM node.
4. The rapid construction method based on BOM relationship tree according to claim 1 is characterized in that: Performing a repetitive judgment on the BOM level on the lower-level branch information to determine the first result information of the BOM level specifically includes: If there is a repeated BOM level in the lower branch information, each BOM node corresponding to the repeated BOM level is stopped, and the cyclic use stop information based on the repeated BOM level is generated; If the lower branch information does not contain the repeated BOM level, query the requisition relationship for each BOM node corresponding to the repeated BOM level, and generate cyclic requisition execution information; The first result information includes the cyclical use stop information and the cyclical use execution information.
5. The rapid construction method based on BOM relationship tree according to claim 1 is characterized in that: The BOM structure in the ERP system completes the construction operation, specifically including: Through a preset breadth-first algorithm, each lower-level branch information in the ERP system is traversed, and a complete BOM structure is constructed based on the judgment operations in the first result information and the second result information.
6. A rapid construction method based on BOM relationship tree according to claim 1, characterized in that: The query processing method of the lower-level BOM node is to perform a one-by-one query processing on each lower-level BOM node.
7. A rapid construction device based on a BOM relationship tree, characterized in that: The device comprises: at least one processor; and, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, so that the at least one processor can execute the rapid construction method based on the BOM relationship tree according to any one of claims 1-6.
8. A non-volatile computer storage medium, characterized in that: The storage medium is a non-volatile computer-readable storage medium, and the non-volatile computer-readable storage medium stores at least one program, each of which includes instructions, and when the instructions are executed by the terminal, the terminal executes a rapid construction method based on a BOM relationship tree according to any one of claims 1-6.
Citation Information
Patent Citations
Product cost accounting method and device
CN115204960A
Aircraft assembly data construction method, device, equipment and medium
CN115357671A