A production information processing method, device, and storage medium

Abstract

Embodiments of the present application provide a production information processing method and device and a storage medium. In the embodiments of the present application, a first data structure used to describe a hierarchical relationship of a production process and a second data structure used to describe a mesh association relationship of a production resource are constructed, and a dynamic linkage mechanism between the two data structures is established to realize a real-time and automatic state synchronization mechanism. Based on this, a state change caused by a production event can be quickly and accurately propagated to all related information nodes, and a complex operation that originally needs multi-step query and sequential update is changed into automatic state synchronization triggered by the event, thereby improving the update efficiency of the system.

Description

Technical Field

[0001] This application relates to the field of data processing technology, and in particular to a method, apparatus and storage medium for processing production information. Background Technology

[0002] In modern manufacturing, as automation levels increase, production lines become increasingly complex. To ensure product quality, optimize production efficiency, and achieve comprehensive traceability, the processing of production line data has become particularly important.

[0003] In existing technologies, a traditional relational database model is typically used, storing production information such as task orders, processes, and batches in separate, predefined database tables. When any information on the production line changes, multiple tables need to be retrieved from the database to query the changed data; then, according to a pre-defined logic, update operations are performed on each table sequentially. This update method is inefficient, and information synchronization suffers from significant delays. Summary of the Invention

[0004] This application provides a production information processing method, device, and storage medium to achieve dynamic linkage of production information and improve update efficiency.

[0005] This application provides a production information processing method applied to a manufacturing system. The method includes: pre-constructing a first data structure and a second data structure in the manufacturing system. The construction process of the first data structure includes: constructing a root node representing a production task order, multiple process segment nodes representing production process stages, and multiple batch nodes representing production execution units; adding parent-child hierarchical relationships between the root node and the multiple process segment nodes, and between the multiple process segment nodes and the multiple batch nodes, so that in the first data structure, each process segment node includes at least one batch node. The construction process of the second data structure includes: constructing multiple resource nodes, including equipment nodes, production line nodes, material nodes, formula nodes, and surplus pool nodes; and establishing parent-child hierarchical relationships between production line nodes, between equipment nodes, and between production line nodes and their dependencies. The method adds associations between equipment nodes, between a formula node and its specified equipment nodes, between a formula node and its dependent material nodes, and between a surplus pool node and other resource nodes to obtain a second data structure; establishes a bidirectional dynamic linkage relationship between batch nodes in the first data structure and multiple resource nodes in the second data structure; the method further includes: when a target production event occurs, determining the source node involved in the target production event, where the source node is a node in the first or second data structure; determining the target node from the second or first data structure based on the dynamic linkage relationship; and synchronizing and updating the state and / or attributes of the source node and the target node according to the target production event and the dynamic linkage relationship to achieve automatic state synchronization between the first and second data structures.

[0006] This application also provides an electronic device, which includes a memory and a processor. The memory is used to store a computer program, and the processor is coupled to the memory to execute the computer program for implementing the steps in any of the production information processing methods.

[0007] This application also provides a computer-readable storage medium storing a computer program / instruction, which, when executed by a processor, enables the processor to implement the steps in any of the production information processing methods.

[0008] In this embodiment, a first data structure describing the hierarchical relationship of the production process and a second data structure describing the network relationship of production resources are constructed, and a dynamic linkage mechanism between the two data structures is established to achieve a real-time, automatic state synchronization mechanism. Based on the state changes caused by production events, they can be quickly and accurately propagated to all relevant information nodes, transforming the complex operation that originally required multiple queries and sequential updates into automatic state synchronization triggered by events, thereby improving the system's update efficiency. Attached Figure Description

[0009] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings: Figure 1 A flowchart illustrating a production information processing method provided for an exemplary embodiment of this application; Figure 2 A schematic diagram of the structure of the first data structure provided in an exemplary embodiment of this application; Figure 3 A schematic diagram of the structure of the second data structure provided in an exemplary embodiment of this application; Figure 4 A flowchart illustrating a synchronous update process provided for an exemplary embodiment of this application; Figure 5 A flowchart illustrating the calculation of the current margin and the number of batch nodes to be created, and the determination of the attributes of each batch node to be created, provided for an exemplary embodiment of this application. Figure 6 A schematic diagram of the process for generating batch break barcodes provided for an exemplary embodiment of this application; Figure 7 A schematic diagram of the process for generating additive information is provided for an exemplary embodiment of this application; Figure 8 A flowchart illustrating a synchronous update process provided for another exemplary embodiment of this application; Figure 9 This is a schematic diagram of the structure of a processing apparatus provided in yet another exemplary embodiment of this application. Detailed Implementation

[0010] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions of this application will be clearly and completely described below in conjunction with specific embodiments and corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of them. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0011] Manufacturing Execution System (MES) is a core system used to achieve digital control over the entire process from production order to final product. Its ability to process production information directly impacts production efficiency. When processing production information, MES typically uses a traditional relational database as its underlying data storage and management architecture. Under this architecture, various types of production information are usually stored in predefined, independent database tables, such as order tables, process tables, and batch tables.

[0012] When a production event occurs on the production line, the system needs to perform complex multi-table join queries to trace and locate all affected production batches, thus traversing the logical relationships between the data. This process is not only logically complex and inefficient, but also requires update operations to be performed sequentially according to a preset logic, resulting in significant delays in information synchronization. This delay makes it impossible to grasp the cascading effects of production anomalies in real time and globally, potentially missing the best opportunity to respond and adjust.

[0013] Based on this, embodiments of this application provide a production information processing method. This method constructs a first data structure to describe the hierarchical relationship of the production process and a second data structure to describe the network relationship of production resources, and establishes a dynamic linkage mechanism between the two data structures to achieve a real-time, automatic state synchronization mechanism. State changes caused by production events can be quickly and accurately propagated to all relevant information nodes, transforming the complex operation that originally required multiple queries and sequential updates into a one-time, event-triggered automatic state synchronization, thereby improving the system's execution efficiency.

[0014] The technical solutions provided by the various embodiments of this application are described in detail below with reference to the accompanying drawings.

[0015] Figure 1 A flowchart illustrating a production information processing method provided for an exemplary embodiment of this application, the method comprising: S1. First and second data structures are pre-built in the manufacturing system.

[0016] The first data structure is a hierarchical data structure used to describe the execution flow of production tasks. In one implementation, the first data structure can be implemented as a tree-like data structure.

[0017] The second data structure is a network data structure that describes various production resources in the manufacturing system and the relationships between them. In one implementation, the second data structure can be implemented as a graph data structure.

[0018] like Figure 2 As shown, the first data structure includes a root node, process segment nodes, and batch nodes. The construction process of the first data structure includes: constructing a root node representing a production task order, multiple process segment nodes representing production process stages, and multiple batch nodes representing production execution units; adding parent-child hierarchical relationships between the root node and the multiple process segment nodes; and adding parent-child hierarchical relationships between the multiple process segment nodes and the multiple batch nodes, so that in the first data structure, each process segment node includes at least one batch node.

[0019] The root node's attributes include production task order information, which is derived from received production instructions and includes, but is not limited to, product type and planned total quantity. Product type refers to the types of products to be produced, and planned total quantity refers to the total quantity of products to be produced. The process segment node's attributes include the process segment's unique identifier, planned task quantity, and equipment information. The planned task quantity is derived from the planned total quantity or bill of materials, and the equipment information represents the equipment identifier corresponding to the process segment node. A parent-child hierarchy is added between the root node and multiple process segment nodes to indicate that the process segment belongs to the root node. Each product type corresponds to one parent-child hierarchy between the root node and process segment nodes. For the same product type, root nodes with different planned total quantities may have different attributes for their corresponding process segment nodes.

[0020] This application does not limit the implementation method of obtaining the task plan quantity or bill of materials based on the total planned quantity. In one implementation, if the input and output of each process segment node are equal in quantity, the task plan quantity in all process segment nodes can be equal to the total planned quantity in the root node. In another implementation, considering that each process segment node has a certain proportion of material loss or a production rate of less than 100%, the task plan quantity of the upstream process segment node can be greater than the task plan quantity of the downstream process segment node. In yet another implementation, the task plan quantity is obtained based on the quantity relationship defined in the bill of materials. The value of the task plan quantity can be defined in the process segment node based on the bill of materials, or the bill of materials can be added to the attributes of the process segment node to obtain the value of the task plan quantity.

[0021] In one optional embodiment, templates for the parent-child hierarchical relationships between root nodes and process segment nodes corresponding to various product types can be pre-built. Upon receiving production task order information, the corresponding parent-child hierarchical relationship between root nodes and process segment nodes can be selected from the templates based on the product types in the production task order information. Alternatively, a mapping relationship between product types and process segment nodes can be pre-set. Upon receiving task order information, the parent-child hierarchical relationship between the root nodes and process segment nodes corresponding to the task order information can be constructed based on the mapping relationship.

[0022] In this embodiment, the batch nodes are not predefined or calculated offline, but are created dynamically and in real time based on the actual situation after receiving the production instruction. A process segment node can contain at least one or more batch nodes. A parent-child hierarchy is added between the process segment node and the batch nodes to indicate that the batch node is a specific execution instance of the process segment.

[0023] The construction process of the second data structure includes: constructing multiple resource nodes, including equipment nodes, production line nodes, material nodes, formula nodes, and surplus pool nodes; adding associations between production line nodes, between equipment nodes, between production line nodes and their dependent equipment nodes, between formula nodes and their specified equipment nodes, between formula nodes and their dependent material nodes, and between surplus pool nodes and other resource nodes to obtain the second data structure.

[0024] Resource nodes represent logical production factors and are abstract representations of various resources in a production system; equipment nodes represent physical production equipment, such as machine tools, assembly lines, and testing instruments, with clear physical boundaries and operational capabilities; production line nodes represent a collection of logically related equipment to achieve a specific production purpose, which are connected in series through the process flow to form a complete production chain; material nodes represent a material entity, including raw materials, semi-finished products, and finished products, and the attributes of material nodes include material identification information; formula nodes represent standardized specifications and process guidelines for manufacturing products, including but not limited to bills of materials and process parameters; and surplus pool nodes are containers used to store and manage the available surplus generated during the production process, realizing the dynamic allocation and optimized utilization of resources.

[0025] like Figure 3 As shown, establishing relationships specifically includes: adding relationships between production line nodes to represent production dependencies between them; adding relationships between equipment nodes to represent transport relationships between them; adding relationships between production line nodes and the equipment nodes they depend on to represent organizational relationships between them; adding relationships between formula nodes and the equipment nodes they specify to represent process constraints; adding relationships between formula nodes and the material nodes they depend on to represent material requirements; and adding relationships between the stock pool node and other resource nodes to represent availability relationships of stock associated with the stock pool node.

[0026] S2. Establish a two-way dynamic linkage relationship between the batch nodes in the first data structure and multiple resource nodes in the second data structure.

[0027] The batch node of the task order is the core hub connecting the logical flow and physical resources. It runs through the entire production process and plays a crucial role in production management, quality traceability, and material control. Each batch node establishes a two-way dynamic linkage relationship with the resource nodes associated with it in the second data structure. The occurrence of a production event triggers a state change in the resource node, which is automatically and in real time synchronized to the associated batch node. Changes in the batch node also cause changes in the resource nodes in the second data structure. When a product quality problem occurs, the problematic batch node can be located, and then all associated nodes that the batch relied on during production can be obtained based on the dynamic linkage relationship. This traceability method has a clear path, complete information, and extremely high efficiency, enabling faster and more accurate identification of the root cause of the problem.

[0028] In one optional embodiment, establishing a bidirectional dynamic linkage relationship includes: for each batch node, determining a first equipment node related to the batch node in the second data structure based on the first process segment node to which the batch node belongs; adding an identifier of the first equipment node and a first linkage identifier to the attribute information of the batch node; the first linkage identifier is used to synchronously update the attribute information of the batch node and its first process segment node when the state of the first equipment node changes; adding the identifier of the batch node and the second linkage identifier to the attribute information of the first equipment node to achieve bidirectional linkage between the batch node and the first equipment node; wherein, the second linkage identifier is used to synchronously update the attribute information of the first equipment node and the production line node, material node, formula node and margin pool node associated with the first equipment node when the batch node changes.

[0029] In the above process, the method for determining the first device node associated with the batch node in the second data structure may include: determining the first device node associated with the batch node based on the device information in the attributes of the first process segment node. The first process segment node may correspond to one or more first device nodes.

[0030] Based on the above architecture, the method includes: S3. When a target production event occurs, determine the source node involved in the target production event. The source node is a node in the first data structure or the second data structure.

[0031] The source node is the starting node that is directly related to or indirectly affects the target production event.

[0032] This application does not limit the implementation method for determining the source node involved in the target production event. In one implementation, the target production event is triggered based on received instruction information. The instruction information is used to create or locate a node in a first data structure or a second data structure, and this node is determined as the source node of the target production event. In another implementation, for a target production event triggered by a change in the physical world state (such as equipment failure), the unique identifier of the physical entity can be parsed from the target production event message, and the corresponding resource node can be located in the second data structure based on the unique identifier. This node is determined as the source node. In yet another implementation, for a target production event driven by internal process logic, such as triggering the next step after one step is completed, the process node that is currently completed or has changed its state can be used as the source node of the next target production event.

[0033] S4. Based on the dynamic linkage relationship, determine the target node from the second data structure or the first data structure.

[0034] Among them, the target node is the node affected by the target production event, and there may be one or more target nodes.

[0035] In one implementation, determining the target node from either the second or first data structure includes: if the target node in the second data structure is determined from the first data structure, determining the identifier and first linkage identifier of the first device node already added to the batch node attributes. This identifier allows for direct and rapid location of the target device node within the second data structure. If the target node in the first data structure is determined from the second data structure, the identifier and second linkage identifier of the batch nodes already added to the first device node attributes can be determined. If one device node corresponds to multiple batch nodes, the affected target node can be determined by traversing the identifiers of these batch nodes.

[0036] S5. Based on the target production event and dynamic linkage relationship, synchronize the state and / or attributes of the source node and the state and / or attributes of the target node to achieve automatic state synchronization between the first data structure and the second data structure.

[0037] During execution, S1-S5 do not need to be executed in full every time. Upon first receiving a production task order with a specific architecture, S1 and S2 need to be executed to establish the first data structure, the second data structure, and the bidirectional dynamic linkage relationship for that architecture type. For subsequent production task orders with the same architecture, the system can directly reuse the established architecture configuration, skipping the repeated initialization steps S1 and S2, and directly execute S3-S5. In an optional embodiment, it can be determined whether it is the same architecture based on the product type in the production task order information.

[0038] The basis for the real-time dynamic linkage update in this application embodiment is to provide a first data structure and a second data structure, which cannot be achieved by traditional data tables.

[0039] In one optional embodiment, the target production event is a batch generation event triggered in response to the root node receiving a task instruction from a production task order. The source node is the second process segment node of the batch node to be created in the first data structure, and the target node is the first surplus pool node associated with the second process segment node in the second data structure. Figure 4 As shown, based on the target production event and dynamic linkage relationship, the status and / or attributes of the source node and the status and / or attributes of the target node are synchronously updated, including: obtaining the task plan quantity from the attributes of the second process segment node; obtaining the historical surplus from the attributes of the first surplus pool node; obtaining the single batch weight from the attributes of the first recipe node associated with the second process segment node; determining the current surplus and the number and attributes of the batch nodes to be created based on the task plan quantity, historical surplus, and single batch weight, including the weight attribute; creating the batch nodes to be created under the second process segment node based on the number and attributes of the batch nodes to be created; if the current surplus is greater than 0, updating the attributes of the first surplus pool node based on the current surplus to achieve synchronous updates of the attributes of the source node and the target node.

[0040] In one implementation, the current surplus and the number and attributes of batch nodes to be created are determined based on the planned task quantity, historical surplus, and single batch weight. The calculation formula is as follows: sum the planned task quantity and historical surplus to obtain a first value; divide the first value by the single batch weight to obtain a second value. Take the integer part of the second value as the number of batch nodes to be created. Add the same weight attribute as the single batch weight to each newly created batch node. Take the weight represented by the remainder of the second value as the current surplus. If the current surplus is greater than zero, add the current surplus and related information, such as the material information of the current surplus, to the attributes of the surplus pool node for subsequent production tasks to use.

[0041] The process of determining the number and attributes of batch nodes to be created can take into account various factors such as production line characteristics, material information, and process stages. When multiple formulas or different equipment groups are involved, the logic for determining the number and attributes of batch nodes to be created may also be different.

[0042] In yet another alternative embodiment, such as Figure 5As shown, based on the planned task quantity, historical surplus, and single batch weight, the current surplus and the number of batch nodes to be created are calculated, and the attributes of each batch node to be created are determined, including: if a second process node is associated with multiple first recipe nodes, the current surplus is initialized as the sum of the planned task quantity and the historical surplus; multiple first recipe nodes are traversed, and for the currently traversed first recipe node: if the current surplus is greater than or equal to the first single batch weight corresponding to the currently traversed first recipe node, the number of batch nodes to be created corresponding to the currently traversed first recipe node is determined based on the number of second equipment nodes associated with the currently traversed first recipe node, and the weight attribute of the batch node to be created is determined based on the first single batch weight corresponding to the currently traversed first recipe node; the value of subtracting the first single batch weight corresponding to the currently traversed first recipe node from the current remaining planned quantity is used as the new current surplus; if the current surplus is less than the first single batch weight corresponding to the currently traversed first recipe node, the traversal is stopped.

[0043] Furthermore, if the first recipe node is associated with multiple second device nodes, the number of batch nodes to be created is determined based on the number of second device nodes associated with the currently traversed first recipe node, including: using the number of associated second device nodes as the number of batch nodes to be created corresponding to the currently traversed first recipe node.

[0044] Accordingly, the weight attribute of the batch node to be created is determined based on the weight of the first batch corresponding to the current first recipe node, including: dividing the weight of the first batch corresponding to the first recipe node into portions based on the number of multiple second device nodes to obtain the divided weights; and determining the divided weights as the weight attribute of the batch node to be created.

[0045] In one optional embodiment, a batch code can be generated for newly created batch nodes. The batch code is a unique identifier for the batch node, constructed by concatenating information fields with specific business meanings. This batch code is generated based on the dynamic linkage relationship established between the batch node and each resource node in the second data structure. The various information fields required to generate the code are obtained by accessing the attributes of multiple resource nodes associated with the batch node.

[0046] This application does not limit the method of generating batch codes. In one implementation, for a newly created batch node, the batch code of the batch node is automatically generated by obtaining one or more of the following information fields from associated resource nodes or their own attributes, such as production line nodes, material nodes, and formula nodes, based on their dynamic linkage relationship: Origin field: A preset code representing the production location. For example, "CZ" can be preset to represent the Changzhou factory.

[0047] Production line field: Represents the identification information of the production line node associated with this batch node.

[0048] The grade field represents the material code. It is further linked to the material node through the recipe node associated with the batch node, and the corresponding material code is obtained from the material node's attributes.

[0049] Date field: Represents date attributes, generally indicating production information. This date resource can be obtained by retrieving the planned date attribute of the production task order in the root node to which the batch node belongs. In one implementation, the obtained date can be dynamically adjusted based on the attributes of the process segment node associated with the batch node and the preset business rules associated with that process segment node. For example, it can be determined whether the process segment node is the first process segment, and the preset business rules associated with that process segment node include the "first process segment date + 2 days" rule stored in the data dictionary, to dynamically adjust the obtained date. In another implementation, the date representation format can also be defined, for example, the last two digits of the year and the month represented by a preset letter (AL).

[0050] Process Segment Field: Represents the identification information of the process segment. This can be obtained by retrieving the identification information of the process segment nodes associated with this batch node.

[0051] Equipment field: Represents production equipment information. The specified equipment node or equipment group information can be obtained through the recipe node associated with the batch node, and the corresponding equipment code can be obtained by querying the preset mapping relationship.

[0052] Prefix / Suffix Fields: Based on the specific attributes of batch nodes, special prefix or suffix codes can be matched and obtained from a preset rule base. For example, the specific attributes of batch nodes can be trial, small trial, or first line opening. In the preset rule base, the code corresponding to trial is LS, the code corresponding to small trial is XS, and the code corresponding to trial is SF.

[0053] Serial Number Field: The serial number of a batch node can be obtained according to the generation order of the batch nodes under the process segment node. For example, the serial number of the first batch node generated under a certain process segment node is 001, and the serial number of the generated batch node is 002.

[0054] According to preset formatting rules, one or more of the information fields obtained above are concatenated in an orderly manner to generate the final batch code. This code is then updated to an attribute of the batch node.

[0055] In one optional embodiment, different scenarios in this application have different encoding rules for batch nodes.

[0056] In one implementation, a special production line coding rule is provided, with the following format: Product Code Derivation Code - Identification Information Corresponding to the Production Line Node - Serial Number Field. Based on this rule, the product code of the material node associated with the batch node is obtained, and a portion of it is extracted as the product code derivation code. The identification information corresponding to the production line node is retrieved from the rule base, along with the serial number field, to generate the batch code for the batch node. In this process, the process number field can be generated incrementally from 001 based on the production line, year, and month.

[0057] In another implementation, a finished product coding rule is provided, with the format: Origin Field - Brand Field - Production Line Field - Date Field - Serial Number Field. The specific generation process will not be described in detail.

[0058] In another implementation, a multi-factor batch number rule is provided, with the following format: Origin Field - Brand Field - Production Line Field - Equipment Field - Process Segment Field - Date Field - Serial Number Field. The specific generation process will not be elaborated further.

[0059] The above method not only enables the automatic and accurate generation of batch codes, but also makes the code itself a highly condensed data carrier. Because its generation process is bound to the first data structure and / or the second data structure, subsequent analysis of this code allows for rapid reverse tracing of key information such as the associated production line, equipment, materials, and processes, greatly improving the precision of production management and the efficiency of information traceability.

[0060] In an optional embodiment, after creating the batch node to be created, the method further includes: generating a batch breakage barcode for the newly created batch node based on the weight attribute value in the attributes of the newly created batch node and the preset packaging weight in the attributes of the first recipe node associated with the newly created batch node, and adding the batch breakage barcode to the attributes of the newly created batch node.

[0061] In one implementation, such as Figure 6 As shown, based on the weight attribute value in the newly created batch node's attributes and the preset packaging weight in the attributes of the first formula node associated with the newly created batch node, a batch break barcode is generated for the newly created batch node. This includes: obtaining the weight attribute value from the attributes of the newly created batch node; obtaining the preset packaging weight from the attributes of the first formula node corresponding to the newly created batch node; dividing the weight attribute value by the preset packaging weight to calculate the quotient and remainder; if the quotient is greater than zero, generating a first batch break barcode with a quantity equal to the quotient; wherein, the first batch break barcode is associated with the preset packaging weight; if the remainder is greater than zero, generating a second batch break barcode, wherein, the second batch break barcode is associated with the weight represented by the remainder.

[0062] In one optional embodiment, unique identification information can be generated for each batch-discontinuing barcode generated under a preset encoding rule to ensure its uniqueness and establish a clear correspondence with its respective batch node. This application does not limit the implementation method for generating the unique identification information of the batch-discontinuing barcode. In one implementation, it can be composed of the batch code of the batch node to which the batch-discontinuing barcode belongs and a two-digit serial number indicating its sequence within that batch node. For example, if the batch code is BATCH-001, the unique identification information of the three batch-discontinuing barcodes generated under it will be BATCH-001-01, BATCH-001-02, and BATCH-001-03, respectively.

[0063] By calculating the quantity first and then assigning codes according to rules, this method not only ensures that each physical packaging unit has a unique and traceable barcode identifier, but also intuitively reflects its subordinate relationship with the production batch node through the coding rules, providing strong data support for subsequent warehousing, logistics and traceability processes.

[0064] In one optional embodiment, additive information is generated for the newly created batch node based on the material requirements list in the attributes of the first formula node corresponding to the newly created batch node, and the batch breakage barcode is added to the attributes of the newly created batch node.

[0065] In one implementation, such as Figure 7 As shown, based on the material requirements list in the attributes of the first formula node corresponding to the newly created batch node, additive information is generated for the newly created batch node. This includes: obtaining the material requirements list from the attributes of the first formula node corresponding to the newly created batch node; filtering the material requirements list to obtain the target material requirements corresponding to the target material codes of at least one process segment node associated with the newly created batch node; and determining a set of corresponding additive information based on at least one target material requirement, where each additive information includes an additive target weight corresponding to the target weight in the target material requirement. For example, if the target material code required by the process segment node corresponding to the newly created batch node is A0103, and if the material requirements list has multiple target material requirements corresponding to A0103, then an additive information is generated for each target material requirement corresponding to A0103, and the additive target weight in the additive information is consistent with the target weight corresponding to the material requirements details.

[0066] In one alternative embodiment, the bill of materials can be stored as a whole production order, or it can be stored as the material requirements information corresponding to each process segment node for each production order.

[0067] In one optional embodiment, to ensure the uniqueness and traceability of each generated additive information record during the production process, coding rules can be set to generate unique identifier information for the additive information of that batch node. This application does not limit the implementation method of the unique identifier information for additive information. In one implementation, the unique identifier information for additive information is generated based on the batch code, the string information of the additive information, the material code corresponding to the additive information, and a two-digit serial number used to distinguish multiple additions of the same material within the same batch. For example, if the batch code is BATCH-001, the string information of the additive information is TJJ, and the material code corresponding to the additive information is [material code missing], then the unique identifier information for the additive information could be BATCH-001-TJJ-M-ADD-X-01.

[0068] These uniquely coded additive information entries, containing precise weight details, are added as a whole to the attributes of the newly created batch node. This provides the production execution unit with clear feeding instructions and detailed data support down to the specific material and batch level for subsequent quality traceability.

[0069] In one optional embodiment, the target production event is a material occupancy event initiated for the first batch of nodes, the source node is the first batch of nodes in the first data structure; the target node is the second batch of nodes in the first data structure, and the second surplus pool node associated with the second batch of nodes; the first batch of nodes belongs to the first process segment node, and the second batch of nodes belongs to the upstream process segment node of the first process segment node. In this scenario, as... Figure 8 As shown, based on the target production event and dynamic linkage relationship, the status and attributes of the source node and the target node are synchronously updated, including: obtaining the output surplus from the attributes of the second surplus pool node; if the output surplus is greater than zero, occupying the output surplus and updating the quantity attribute of the second surplus pool node; if the occupied output surplus does not meet the resource quantity required by the material occupation event, calculating the remaining occupation quantity, which is the difference between the material occupation request and the output surplus; selecting the third batch node in the production completion state from the second batch nodes; occupying the output quantity of the third batch node according to the remaining occupation quantity and updating the output quantity in the attributes of the third batch node; if the sum of the occupied output surplus and the occupied output quantity of the third batch node meets the resource quantity required by the material occupation event, updating the status of the first batch node to the material ready state.

[0070] In another optional embodiment, the target production event is a material occupancy event initiated by the fourth batch node. The goal of this event is to pre-occupy specific materials generated in its upstream or related processes for the production of the fourth batch node. The source node is the fourth batch node in the first data structure, the target node is the fifth batch node in the first data structure, the fifth batch node is the material source batch node of the fourth batch node, and the surplus pool node and material node are in the second data structure. In this case, the state and attributes of the source node and the target node are synchronously updated according to the target production event and dynamic linkage relationship, including: obtaining preset material occupancy rules from the attributes of the recipe node or root node associated with the fourth batch node. This rule defines the codes for materials that need to be occupied and the codes for materials that may be occupied. Based on the occupied material codes, other process nodes under the same root node as the fourth batch node are queried through dynamic linkage to determine whether there is a fifth batch node that produces occupied material codes. If a fifth batch node exists, the third reserve pool node associated with the fifth batch node is determined. The output reserve in the third reserve pool node is occupied first. If the output reserve is greater than zero, the output reserve is occupied, and the quantity attribute of the third reserve pool node is updated. If the occupied output reserve does not meet the resource quantity required for the material occupancy event, the remaining occupied quantity is calculated, and the output quantity of the fifth batch node is occupied according to the remaining occupied quantity, and the output quantity in the attribute of the fifth batch node is updated. If the sum of the occupied output reserve and the occupied output quantity of the fifth batch node meets the resource quantity required for the material occupancy event, the status of the fourth batch node is updated to the material ready state.

[0071] In an alternative embodiment, if the fourth batch node does not find the occupied material code in its attributes, but instead finds the occupied material code, this indicates that the fourth batch node itself is the source of the material, and its output needs to be released for use by other nodes.

[0072] In one optional embodiment, the target production event is a material preparation event initiated for the third batch node. The source node is the third batch node in the first data structure, and the target node is at least one first material node in the second data structure. The first material node refers to a material node whose attributes include the identifier of the third batch node. In this scenario, based on the target production event and the dynamic linkage relationship, the state and attributes of the source node and the target node are synchronously updated, including: obtaining first additive information from the attributes of the third batch node, the first additive information including a material code; determining the target material node from at least one first material node based on the material code in the first additive information; establishing a temporary consumption link between the third batch node and the target material node; controlling the production execution unit corresponding to the third batch node to obtain the target material from the target material node through the temporary consumption link based on the weight data in the first additive information, and updating the attributes of the target material node and the attributes of the third batch node in real time; after the production execution unit completes the acquisition operation of the target material, canceling the temporary consumption link and updating the production status of the third batch node to the material preparation status.

[0073] In one optional embodiment, the target production event is a state change event occurring on a shared resource node that is associated with the first production line node and the second production line node. The source node is the shared resource node, and the target nodes are the first production line node, the second production line node, and nodes related to the first and second production line nodes in the first and second data structures. In this scenario, based on the target production event and the dynamic linkage relationship, the states of the source node and the target node are synchronously updated, including: updating the state of the shared resource node to reflect the new state of the state change event; and updating the states of the first production line node, the second production line node, and nodes related to the first and second production line nodes in the first and second data structures according to the degree of influence of the shared resource node, thereby achieving synchronous updates of the states of the source node and the target node.

[0074] It should be noted that the execution subject of each step in the method provided in the above embodiments can be the same device, or the method can be executed by different devices. For example, the execution subject of steps S1 to S5 can be device A; or the execution subject of steps S1 and S2 can be device A, and the execution subject of step S3 can be device B; and so on.

[0075] Furthermore, in some of the processes described in the above embodiments and accompanying drawings, multiple operations appear in a specific order. However, it should be clearly understood that these operations may not be executed in the order they appear herein, or they may be executed in parallel. The operation numbers, such as S1, S2, etc., are merely used to distinguish different operations and do not represent any execution order. Additionally, these processes may include more or fewer operations, and these operations may be executed sequentially or in parallel. It should be noted that the descriptions such as "first" and "second" in this document are used to distinguish different messages, devices, modules, etc., and do not represent a sequential order, nor do they limit "first" and "second" to different types.

[0076] Figure 9 This is a schematic diagram of a processing apparatus provided as another exemplary embodiment of this application. (See diagram below.) Figure 9 As shown, the processing device includes a memory 54, a processor 55, and a communication component 56.

[0077] Memory 54 is used to store computer programs and can be configured to store various other data to support operation on the processing device. Examples of this data include instructions for any application or method operating on the processing device, contact data, phone book data, messages, pictures, videos, etc.

[0078] The memory 54 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk or optical disk.

[0079] Processor 55, coupled to memory 54, is used to execute computer programs in memory 54 for: pre-constructing a first data structure and a second data structure in the manufacturing system. The construction process of the first data structure includes: constructing a root node representing a production task order, multiple process segment nodes representing production process stages, and multiple batch nodes representing production execution units; adding parent-child hierarchical relationships between the root node and the multiple process segment nodes, and adding parent-child hierarchical relationships between the multiple process segment nodes and the multiple batch nodes, so that in the first data structure, each process segment node includes at least one batch node. The construction process of the second data structure includes: constructing multiple resource nodes, including equipment nodes, production line nodes, material nodes, formula nodes, and surplus pool nodes; and establishing parent-child hierarchical relationships between production line nodes, between equipment nodes, and between production line nodes and their dependencies. The device adds associations between equipment nodes, between a formula node and its specified equipment nodes, between a formula node and its dependent material nodes, and between a surplus pool node and other resource nodes to obtain a second data structure. It establishes a bidirectional dynamic linkage relationship between batch nodes in the first data structure and multiple resource nodes in the second data structure. The device also includes: when a target production event occurs, determining the source node involved in the target production event, where the source node is a node in either the first or second data structure; determining the target node from the second or first data structure based on the dynamic linkage relationship; and synchronously updating the state and / or attributes of the source node and the target node according to the target production event and the dynamic linkage relationship to achieve automatic state synchronization between the first and second data structures.

[0080] In one optional embodiment, a bidirectional dynamic linkage relationship is established between batch nodes in the first data structure and multiple resource nodes in the second data structure, including: for each batch node, determining a first equipment node related to the batch node in the second data structure based on the first process segment node to which the batch node belongs; adding an identifier of the first equipment node and a first linkage identifier to the attribute information of the batch node; the first linkage identifier is used to synchronously update the attribute information of the batch node and its first process segment node when the state of the first equipment node changes; adding the identifier of the batch node and the second linkage identifier to the attribute information of the first equipment node to realize bidirectional linkage between the batch node and the first equipment node; wherein, the second linkage identifier is used to synchronously update the attribute information of the first equipment node and the production line node, material node, formula node and margin pool node associated with the first equipment node when the batch node changes.

[0081] In one optional embodiment, the target production event is a batch generation event triggered in response to the root node receiving a task instruction from a production task order. The source node is the second process segment node of the batch node to be created in the first data structure, and the target node is the first surplus pool node associated with the second process segment node in the second data structure. Based on the target production event and dynamic linkage relationship, the state and / or attributes of the source node and the state and / or attributes of the target node are synchronously updated, including: obtaining the planned task quantity from the attributes of the second process segment node; obtaining the historical surplus from the attributes of the first surplus pool node; obtaining the single batch weight from the attributes of the first recipe node associated with the second process segment node; determining the current surplus and the number and attributes of the batch node to be created based on the planned task quantity, historical surplus, and single batch weight, including weight attributes; creating the batch node to be created under the second process segment node based on the number and attributes of the batch node to be created; if the current surplus is greater than 0, updating the attributes of the first surplus pool node based on the current surplus to achieve synchronous updates of the attributes of the source node and the target node.

[0082] In one optional embodiment, the current remaining quantity and the number of batch nodes to be created are calculated based on the task plan quantity, historical remaining quantity, and single batch weight, and the attributes of each batch node to be created are determined, including: if a second process segment node is associated with multiple first recipe nodes, the current remaining quantity is initialized as the sum of the task plan quantity and the historical remaining quantity; multiple first recipe nodes are traversed, and for the currently traversed first recipe node: if the current remaining quantity is greater than or equal to the first single batch weight corresponding to the currently traversed first recipe node, the number of batch nodes to be created corresponding to the currently traversed first recipe node is determined based on the number of second equipment nodes associated with the currently traversed first recipe node, and the weight attribute of the batch node to be created is determined based on the first single batch weight corresponding to the currently traversed first recipe node; the current remaining plan quantity is subtracted from the current traversed first recipe node's weight. The weight of the first batch corresponding to the first recipe node is used as the new current margin; if the current margin is less than the weight of the first batch corresponding to the currently traversed first recipe node, the traversal stops; if the first recipe node is associated with multiple second device nodes, the number of batch nodes to be created is determined according to the number of second device nodes associated with the currently traversed first recipe node, including: using the number of associated second device nodes as the number of batch nodes to be created corresponding to the currently traversed first recipe node; correspondingly, the weight attribute of the batch nodes to be created is determined according to the weight of the first batch corresponding to the current first recipe node, including: dividing the weight of the first batch corresponding to the first recipe node according to the number of multiple second device nodes to obtain the divided weight; the divided weight is determined as the weight attribute of the batch nodes to be created.

[0083] In an optional embodiment, after creating the batch node to be created, the processor 55 is further configured to: generate a batch breakage barcode for the newly created batch node based on the weight attribute value in the attributes of the newly created batch node and the preset packaging weight in the attributes of the first formula node associated with the newly created batch node, and add the batch breakage barcode to the attributes of the newly created batch node; and / or generate additive information for the newly created batch node based on the bill of materials in the attributes of the first formula node corresponding to the newly created batch node, and add the additive information to the attributes of the newly created batch node.

[0084] In one optional embodiment, the target production event is a material occupancy event initiated for the first batch of nodes; the source node is the first batch of nodes in the first data structure; the target node is the second batch of nodes in the first data structure, and the second surplus pool node associated with the second batch of nodes; the first batch of nodes belongs to the first process segment node, and the second batch of nodes belongs to the upstream process segment node of the first process segment node; based on the target production event and dynamic linkage relationship, the state and attributes of the source node and the state and attributes of the target node are synchronously updated, including: obtaining the output surplus from the attributes of the second surplus pool node; if the output surplus is greater than zero... If the occupied output surplus is insufficient, the quantity attribute of the second surplus pool node is updated. If the occupied output surplus does not meet the resource requirement of the material occupancy event, the remaining occupancy is calculated as the difference between the material occupancy request and the output surplus. A third batch node in the production completion state is selected from the second batch nodes. The output of the third batch node is occupied according to the remaining occupancy, and the output in the attribute of the third batch node is updated. If the sum of the occupied output surplus and the occupied output of the third batch node meets the resource requirement of the material occupancy event, the status of the first batch node is updated to the material ready state.

[0085] In an optional embodiment, the target production event is a material preparation event initiated for the third batch node. The source node is the third batch node in the first data structure, and the target node is at least one first material node in the second data structure. The first material node refers to a material node whose attributes include the identifier of the third batch node. Based on the target production event and the dynamic linkage relationship, the state and attributes of the source node and the target node are synchronously updated, including: obtaining first additive information from the attributes of the third batch node, the first additive information including a material code; determining the target material node from at least one first material node based on the material code in the first additive information; establishing a temporary consumption link between the third batch node and the target material node; controlling the production execution unit corresponding to the third batch node to obtain the target material from the target material node through the temporary consumption link based on the weight data in the first additive information, and updating the attributes of the target material node and the third batch node in real time; after the production execution unit completes the acquisition operation of the target material, canceling the temporary consumption link and updating the production status of the third batch node to the material preparation status.

[0086] In one optional embodiment, the target production event is a state change event occurring on a shared resource node that is associated with the first production line node and the second production line node. The source node is the shared resource node, and the target node is the first production line node, the second production line node, and nodes related to the first and second production line nodes in the first and second data structures. Based on the target production event and the dynamic linkage relationship, the states of the source node and the target node are synchronously updated, including: updating the state of the shared resource node to reflect the new state of the state change event; and updating the states of the first production line node, the second production line node, and nodes related to the first and second production line nodes in the first and second data structures according to the degree of influence of the shared resource node, so as to achieve synchronous updating of the states of the source node and the target node.

[0087] Furthermore, such as Figure 9 As shown, the processing device also includes other components such as a communication component 56, a display 57, a power supply component 58, and an audio component 59. Figure 9 The diagram only shows some components and does not imply that the processing device includes only these components. Figure 9 The components shown.

[0088] Accordingly, embodiments of this application also provide a computer-readable storage medium storing a computer program, which, when executed, can perform the steps that can be executed by a processing device in the above method embodiments.

[0089] The above Figure 9The communication component is configured to facilitate wired or wireless communication between the device containing the communication component and other devices. The device containing the communication component can access wireless networks based on communication standards, such as WiFi, 2G, 3G, 4G / LTE, 5G, or combinations thereof. In one exemplary embodiment, the communication component receives broadcast signals or broadcast-related information from an external broadcast management system via a broadcast channel. In one exemplary embodiment, the communication component further includes a Near Field Communication (NFC) module to facilitate short-range communication. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID), Infrared Data Association (IrDA) technology, Ultra-Wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.

[0090] The above Figure 9 The display includes a screen, which may include a liquid crystal display (LCD) and a touch panel (TP). If the screen includes a touch panel, the screen can be implemented as a touchscreen to receive input signals from the user. The touch panel includes one or more touch sensors to sense touches, swipes, and gestures on the touch panel. The touch sensors can sense not only the boundaries of the touch or swipe action, but also the duration and pressure associated with the touch or swipe operation.

[0091] The above Figure 9 The power supply component provides power to the various components of the device in which it resides. The power supply component may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power to the device in which it resides.

[0092] The above Figure 9 The audio component can be configured to output and / or input audio signals. For example, the audio component includes a microphone (MIC) configured to receive external audio signals when the device containing the audio component is in an operating mode, such as call mode, recording mode, or voice recognition mode. The received audio signals can be further stored in memory or transmitted via a communication component. In some embodiments, the audio component also includes a speaker for outputting audio signals.

[0093] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0094] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0095] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0096] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0097] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0098] Memory may include non-persistent storage in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0099] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, 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 technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0100] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0101] The above description is merely an embodiment of this application and is not intended to limit the scope of this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the scope of the claims of this application.

Claims

1. A production information processing method, characterized in that, Applied to a manufacturing system, the method includes: A first data structure and a second data structure are pre-built in the manufacturing system. The construction process of the first data structure includes: building a root node representing a production task order, multiple process segment nodes representing production process stages, and multiple batch nodes representing production execution units; adding a parent-child hierarchical relationship between the root node and the multiple process segment nodes; and adding a parent-child hierarchical relationship between the multiple process segment nodes and the multiple batch nodes, so that a process segment node in the first data structure includes at least one batch node. The construction process of the second data structure includes: constructing multiple resource nodes, including equipment nodes, production line nodes, material nodes, formula nodes, and surplus pool nodes; adding association relationships between the production line nodes, between the equipment nodes, between the production line nodes and the equipment nodes they depend on, between the formula nodes and the equipment nodes they specify, between the formula nodes and the material nodes they depend on, and between the surplus pool nodes and other resource nodes to obtain the second data structure; A two-way dynamic linkage relationship is established between the batch nodes in the first data structure and multiple resource nodes in the second data structure; The method further includes: When a target production event occurs, the source node involved in the target production event is determined, and the source node is a node in the first data structure or the second data structure; Based on the dynamic linkage relationship, the target node is determined from the second data structure or the first data structure; Based on the target production event and the dynamic linkage relationship, the state and / or attributes of the source node and the state and / or attributes of the target node are synchronously updated to achieve automatic state synchronization between the first data structure and the second data structure; The step of establishing a bidirectional dynamic linkage relationship between batch nodes in the first data structure and multiple resource nodes in the second data structure includes: for each batch node, determining a first equipment node in the second data structure related to the batch node based on the first process segment node to which the batch node belongs; adding an identifier of the first equipment node and a first linkage identifier to the attribute information of the batch node; the first linkage identifier is used to synchronously update the attribute information of the batch node and its first process segment node when the state of the first equipment node changes; adding the identifier of the batch node and a second linkage identifier to the attribute information of the first equipment node to achieve bidirectional linkage between the batch node and the first equipment node; wherein, the second linkage identifier is used to synchronously update the attribute information of the first equipment node and the production line node, material node, formula node, and margin pool node associated with the first equipment node when the batch node changes.

2. The method according to claim 1, characterized in that, The target production event is a batch generation event triggered in response to the root node receiving the task instruction of the production task order. The source node is the second process segment node of the batch node to be created in the first data structure, and the target node is the first surplus pool node associated with the second process segment node in the second data structure. Based on the target production event and the dynamic linkage relationship, the state and / or attributes of the source node and the state and / or attributes of the target node are synchronized and updated, including: Obtain the planned task quantity from the attributes of the second process segment node; Obtain the historical balance from the attributes of the first balance pool node; Obtain the single batch weight from the attributes of the first recipe node associated with the second process segment node; Based on the planned task volume, the historical remaining volume, and the single batch weight, determine the current remaining volume and the number and attributes of the batch nodes to be created, including the weight attribute; Based on the number and attributes of the batch nodes to be created, create the batch nodes to be created under the second process segment node; If the current balance is greater than 0, the attributes of the first balance pool node are updated based on the current balance to achieve synchronous updates of the attributes of the source node and the target node.

3. The method according to claim 2, characterized in that, The step of calculating the current remaining amount and the number of batch nodes to be created based on the planned task volume, the historical remaining amount, and the single batch weight, and determining the attributes of each batch node to be created, includes: If the second process segment node is associated with multiple first recipe nodes, the current reserve is initialized as the sum of the task plan quantity and the historical reserve. Traverse multiple first recipe nodes. For the currently traversed first recipe node: If the current remaining amount is greater than or equal to the weight of the first single batch corresponding to the first recipe node currently being traversed, then the number of batch nodes to be created corresponding to the first recipe node currently being traversed is determined based on the number of second device nodes associated with the first recipe node currently being traversed, and the weight attribute of the batch nodes to be created is determined based on the weight of the first single batch corresponding to the current first recipe node; the value of subtracting the weight of the first single batch corresponding to the current first recipe node from the current remaining planned amount is taken as the new current remaining amount; If the current remaining amount is less than the weight of the first batch corresponding to the first recipe node currently being traversed, stop traversing; If the first recipe node is associated with multiple second device nodes, the number of batch nodes to be created is determined based on the number of second device nodes associated with the currently traversed first recipe node, including: The number of associated second device nodes is taken as the number of batch nodes to be created corresponding to the first recipe node currently being traversed; Accordingly, the weight attribute of the batch node to be created is determined based on the first batch weight corresponding to the current first recipe node, including: Based on the number of the plurality of second device nodes, the weight of the first batch corresponding to the first formula node is divided to obtain the divided weight. The weight after partitioning is determined as the weight attribute of the batch nodes to be created.

4. The method according to claim 2, characterized in that, After creating the batch nodes to be created, the method further includes: Based on the weight attribute value in the newly created batch node attributes and the preset packaging weight in the attributes of the first recipe node associated with the newly created batch node, a batch breakage barcode is generated for the newly created batch node, and the batch breakage barcode is added to the attributes of the newly created batch node. and / or Based on the material requirements list in the attributes of the first recipe node corresponding to the newly created batch node, additive information is generated for the newly created batch node, and the additive information is added to the attributes of the newly created batch node.

5. The method according to any one of claims 1-4, characterized in that, The target production event is a material occupancy event initiated for the first batch node, the source node is the first batch node in the first data structure; the target node is the second batch node in the first data structure, and the second surplus pool node associated with the second batch node; the first batch node belongs to the first process segment node, and the second batch node belongs to the upstream process segment node of the first process segment node; Based on the target production event and the dynamic linkage relationship, the state and attributes of the source node and the state and attributes of the target node are synchronized and updated, including: Obtain the output surplus from the attributes of the second surplus pool node; if the output surplus is greater than zero, then occupy the output surplus and update the quantity attribute of the second surplus pool node. If the occupied output balance does not meet the resource quantity required by the material occupancy event, then calculate the remaining occupancy quantity, which is the difference between the material occupancy request and the output balance; select a third batch node that is in the production completion state from the second batch nodes; occupy the output of the third batch node according to the remaining occupancy quantity, and update the output quantity in the attributes of the third batch node; If the sum of the occupied output surplus and the occupied output of the third batch node meets the resource quantity required by the material occupation event, the status of the first batch node is updated to the material ready state.

6. The method according to any one of claims 1-4, characterized in that, The target production event is a material preparation event initiated for the third batch node. The source node is the third batch node in the first data structure. The target node is at least one first material node in the second data structure. The first material node refers to a material node whose attributes include the identifier of the third batch node. Based on the target production event and the dynamic linkage relationship, the state and attributes of the source node and the state and attributes of the target node are synchronized and updated, including: Obtain first additive information from the attributes of the third batch of nodes, the first additive information including material code; Based on the material code in the first additive information, the target material node is determined from the at least one first material node; Establish a temporary consumption link between the third batch node and the target material node; Based on the weight data in the first additive information, the production execution unit corresponding to the third batch node is controlled to obtain the target material from the target material node through the temporary consumption link, and the attributes of the target material node and the third batch node are updated in real time. After the production execution unit completes the acquisition of the target material, the temporary consumption link is canceled, and the production status of the third batch node is updated to material preparation status.

7. The method according to any one of claims 1-4, characterized in that, The target production event is a state change event that occurs on a shared resource node that is associated with the first production line node and the second production line node. The source node is the shared resource node, and the target node is the first production line node, the second production line node, and the nodes related to the first production line node and the second production line node in the first data structure and the second data structure. Based on the target production event and the dynamic linkage relationship, the states of the source node and the target node are synchronized and updated, including: Update the state of the shared resource node to reflect the new state of the state change event; Based on the degree of influence from the shared resource nodes, the states of the first production line node, the second production line node, and the nodes related to the first and second production line nodes in the first and second data structures are updated to achieve synchronous updates of the state of the source node and the state of the target node.

8. An electronic device, characterized in that, The method includes a memory and a processor, the memory being used to store a computer program, and the processor being coupled to the memory for executing the computer program to implement the steps of the method according to any one of claims 1-7.

9. A computer-readable storage medium storing computer programs / instructions, characterized in that, When the computer program / instructions are executed by the processor, the processor is enabled to perform the steps of the method according to any one of claims 1-7.

Images