CN117093144A - Flexible storage method and system for BOM order - Google Patents
Flexible storage method and system for BOM order Download PDFInfo
- Publication number
- CN117093144A CN117093144A CN202310955277.9A CN202310955277A CN117093144A CN 117093144 A CN117093144 A CN 117093144A CN 202310955277 A CN202310955277 A CN 202310955277A CN 117093144 A CN117093144 A CN 117093144A
- Authority
- CN
- China
- Prior art keywords
- bom
- node
- check
- standard
- production order
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000004519 manufacturing process Methods 0.000 claims abstract description 88
- 230000004048 modification Effects 0.000 claims abstract description 26
- 238000012986 modification Methods 0.000 claims abstract description 26
- 238000004458 analytical method Methods 0.000 claims abstract description 10
- 238000012795 verification Methods 0.000 claims description 45
- 238000007726 management method Methods 0.000 claims description 10
- 238000004364 calculation method Methods 0.000 claims description 6
- 239000000284 extract Substances 0.000 claims description 6
- 230000001174 ascending effect Effects 0.000 claims description 5
- 239000000463 material Substances 0.000 description 5
- 239000002994 raw material Substances 0.000 description 4
- 230000000712 assembly Effects 0.000 description 3
- 238000000429 assembly Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0683—Plurality of storage devices
- G06F3/0685—Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/166—Editing, e.g. inserting or deleting
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06Q10/0875—Itemisation or classification of parts, supplies or services, e.g. bill of materials
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- General Engineering & Computer Science (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Human Computer Interaction (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Manufacturing & Machinery (AREA)
- Development Economics (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Computational Linguistics (AREA)
- Primary Health Care (AREA)
- Data Mining & Analysis (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a flexible storage method and a flexible storage system for BOM orders. According to the method, a rapid node positioning and matching analysis algorithm is established aiming at the BOM data structure of the production order, so that the modification node of the BOM data structure can be rapidly positioned, and further, for the order which is not modified relative to the standard BOM, the repeated storage is avoided, and redundant data is avoided; and judging and storing orders different from the standard BOM according to the modification action, and supporting the adjustment of the client on the standard BOM.
Description
Technical Field
The application relates to the technical field of data storage, in particular to a flexible storage method and system for BOM orders.
Background
For MES, ERP, etc., production management software systems, BOM orders are among the most basic forms of data organization and data storage structures.
BOM order is material order, and bill of materials is required parts detail table and structure of product. The term "material" is used herein in a broad sense and is a generic term for all production-related physical entities such as products, parts, components, parts, raw materials, kits, and the like. Thus, the BOM order generally records the structural relationships of entities such as products, components, assemblies, parts, raw materials, accessories, etc. hierarchically in a preset data structure, and further records the necessary information such as the number, type, number, name, source, attribute description, etc. of the corresponding entities for each hierarchy, and records the factors such as time related to the entities from the production perspective.
For a large complex industrial product, BOM orders are typically designed to have a hierarchy of up to 10 layers or more, with the total number of entities involved in the BOM order being many thousands of times. How to effectively create, manage and employ BOM orders for the primary resolution of production management software systems.
To reduce the difficulty of building, managing, and employing BOM orders, production management software systems typically predefine a series of standard BOMs for different levels of entities and combinations thereof, such as products, parts, assemblies, parts, raw materials, kits, and the like. The user can modify the standard BOM to form a customized BOM special for the production order, and then the production management software system can store the BOM special for the production order of the user and call and apply the BOM according to the requirement.
However, in practice it has been found that many production order specific BOMs actually employed by users are identical to standard BOMs; alternatively, the production order specific BOM is the same as the standard BOM in terms of most of the material entities, and a small number of the material entities are different. In the prior art, the same BOM special for production orders as the standard BOM can be stored separately, so that data redundancy is caused, and the load of a production management software system is increased. On the other hand, for large BOM orders, because of the large number of levels and entities contained in each level, there is often a long delay time for reading and storing.
Disclosure of Invention
The application provides a flexible storage method and a flexible storage system for BOM orders. In the application, in the production order generation process based on the standard BOM, the BOM modification and verification link is added, and the standard BOM is not stored repeatedly under the condition that the production order adopts the BOM which is completely the same as the standard BOM, thereby avoiding redundant data and reducing the system load.
The flexible storage method for BOM orders is characterized by comprising the following steps:
invoking a standard BOM by a user to edit the production order;
executing BOM modification verification when saving a production order edited by a user;
for a production order of the verified unmodified standard BOM, performing associated registration on the production order and the standard BOM, and not storing the BOM for the production order separately;
for production orders for which the standard BOM is verified and modified, a production order specific BOM is generated and saved.
Preferably, in the case of a standard BOM upgrade, to avoid affecting the production order associated therewith, a primary version of the standard BOM backup is automatically generated and the production order association associated with the original standard BOM is registered to the standard BOM backup.
Preferably, in the BOM modification verification, the modification node in the BOM hierarchical data structure is located through a fast node locating and matching analysis algorithm.
It is further preferred that the fast node location and matching analysis algorithm comprises the steps of:
s201, dividing BOM of a production order edited by a user into Q node groups during storage; each node group comprises a root node and a lower node thereof, wherein the root node is positioned at a specific level in the BOM data structure;
s202, k node groups are taken out from the Q node groups at a time, and the verification load of each node group is estimated;
s203, the k node groups are subjected to verification load L i Is ordered in descending order of size;
s204, sequentially placing k node groups into a check queue { G } min ,…G max In }; wherein, according to the check load of the node group which has been put into the check queue, the check load is changed from small to largeAscending order of G min Check queue representing minimum check load, G max A check queue with the maximum check load is represented; the node group with the largest verification load in the current k node groups is added to a verification queue with the smallest verification load; the node group with the smallest check load in the current k node groups is added to a check queue with the largest check load; outputting each updated check queue;
s205, judging whether all Q node groups have been traversed; if it has already been traversed, step S206 is entered; if not, returning to the step S202, and starting the next iteration;
step S206, establishing a parallel execution check thread for each check queue;
in step S207, each verification thread extracts a matching node group from the standard BOM for the current node group in its corresponding verification queue, and verifies whether the current node group has a modification with respect to the matching node group of the standard BOM.
Preferably, the load calculation formula of each node group is as follows:
L i ＝fl(node i )
wherein L is i Representing the estimated check load of the ith node group in the k node groups, node i Representing the number of BOM data structure nodes contained within the ith node group, the function fl (·) represents an estimated function from the number of nodes within the node group to the check load.
Preferably, the matching node group in the standard BOM is a node group having the same root node as the current node group in the standard BOM.
Preferably, if a matching node group having the same root node as the current node group cannot be extracted in the standard BOM, a verification result modified with respect to the standard node group is generated.
The flexible storage system for BOM orders according to the application is characterized in that it comprises:
a production order editing unit for editing a production order by a user calling a standard BOM;
the BOM modification verification unit is used for executing BOM modification verification when the production order edited by the user is stored;
the BOM management unit is used for carrying out associated registration on the production order and the standard BOM for the production order of the verified unmodified standard BOM, and the BOM for the production order is not stored separately; generating and storing a production order special BOM for the production order of which the standard BOM is verified and modified;
and the BOM library is used for storing standard BOMs and production order special BOMs.
Preferably, in the case of a standard BOM upgrade, the BOM management unit automatically generates a standard BOM backup of the original version and registers the production order association associated with the original standard BOM to the standard BOM backup in order to avoid affecting the production order associated therewith.
Preferably, the BOM management unit specifically includes:
the node group dividing unit is used for dividing the BOM of the production order edited by the user into Q node groups when the production order is stored; each node group includes a root node at a particular level in the BOM data structure and its lower nodes.
A check load calculation unit for extracting k node groups from the Q node groups at a time, estimating the check load of each node group, and setting the k node groups according to the check load L i Is ordered in descending order of size.
A check queue unit including multiple check queues { G }, a plurality of check queues { G mjn ,…G max In which G is arranged in ascending order from small to large according to the check load of the node group which has been put into the check queue min Check queue representing minimum check load, G max A check queue with the maximum check load is represented; and put k node groups into check queue { G }, in order min ,…G max The node group with the largest check load in the current k node groups is added to a check queue with the smallest check load; and vice versa, the node group with the smallest check load in the current k node groups is added to the check queue with the largest check load, and each updated check queue is output.
A checking thread unit, which establishes a checking thread executed in parallel for each checking queue; each verification thread extracts a matching node group from the standard BOM for the current node group in its corresponding verification queue and verifies whether the current node group has a modification with respect to the matching node group of the standard BOM.
According to the application, by adding the BOM modification and verification link, the repeated storage of the standard BOM is avoided, thereby avoiding redundant data and reducing the system load; in the modification and verification process, through a rapid node positioning and matching analysis algorithm, the verification speed is improved, no larger delay is generated, and the user experience is ensured; in the case of standard BOM version updates, it is ensured that the production order associated therewith is not affected, and the reliability of the system is improved.
Drawings
The drawings that are needed in the embodiments or prior art description will be briefly described below, and it will be apparent that the drawings in the following description are some embodiments of the present application and that other drawings may be obtained from these drawings without inventive effort to those of ordinary skill in the art.
FIG. 1 is a flow chart of a flexible storage method for BOM orders provided by the present application;
FIG. 2 is a block diagram of a flexible storage system for BOM orders provided by the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application become more apparent, the technical solutions in the embodiments of the present application will be described in more detail below with reference to the accompanying drawings in the embodiments of the present application.
It should be noted that: in the drawings, the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The described embodiments are some, but not all, embodiments of the application, and the embodiments and features of the embodiments of the application may be combined with each other without conflict. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
The flexible storage method for BOM orders disclosed by the application is described in detail below with reference to FIG. 1, and comprises the following steps:
s1: invoking a standard BOM by a user to edit the production order;
s2: executing BOM modification verification when saving a production order edited by a user;
s3: for a production order of the verified unmodified standard BOM, performing associated registration on the production order and the standard BOM, and not storing the BOM for the production order separately;
s4: for production orders for which the standard BOM is verified and modified, a production order specific BOM is generated and saved.
The BOM adopts a hierarchical data structure, records the necessary information of the quantity, type, number, name, source, attribute description, related time and the like of the entities such as products, components, assemblies, parts, raw materials, fittings and the like related to production, and takes each recorded entity as a node of the BOM data structure, wherein the node relation indicates the structural association of the entities in production, for example, the node of one product entity can be associated with the nodes of a plurality of component entities, and the node of one component entity can be associated with the nodes of a plurality of assembly entities. For large, complex industrial products, BOM data structures are as many as 10 levels in hierarchy, involving thousands of nodes in total. If the BOM is sequentially checked node by node, whether the BOM is modified relative to the standard BOM is checked, larger time delay is necessarily generated, and the working efficiency and the user experience are reduced.
Thus, in the BOM modification check of step S2, a modified node in the BOM hierarchical data structure is located by a fast node locating and matching analysis algorithm. Specifically, the fast node location and matching analysis algorithm comprises the following steps:
s201, dividing BOM of a production order edited by a user into Q node groups during storage; each node group includes a root node at a particular level in the BOM data structure and its lower nodes.
S202, k node groups are taken out from the Q node groups at a time, and the verification load of each node group is estimated. The load calculation formula for each node group is as follows:
L i ＝fl(node i )
wherein K is i Representing the estimated check load of the ith node group in the k node groups, node i Representing the number of BOM data structure nodes contained within the ith node group, the function fl (·) represents an estimated function from the number of nodes within the node group to the check load.
S203, the k node groups are subjected to verification load L i Is ordered in descending order of size.
S204, sequentially placing k node groups into a check queue { G } min ,…G max In }; wherein G is arranged in ascending order from small to large according to the check load of the node group which has been put into the check queue min Check queue representing minimum check load, G max Indicating the check queue with the greatest check load. This means that the node group with the largest check load among the current k node groups will be added to the check queue with the smallest check load; vice versa, the node group with the smallest check load of the current k node groups will be added to the check queue with the largest check load. Outputting each updated check queue.
S205, judging whether all Q node groups have been traversed; if it has already been traversed, step S206 is entered; if not, returning to the step S202, and starting the next iteration;
step S206, establishing a parallel execution check thread for each check queue;
in step S207, each verification thread extracts a matching node group from the standard BOM for the current node group in its corresponding verification queue, and verifies whether the current node group has a modification with respect to the matching node group of the standard BOM.
In step S207, the matching node group in the standard BOM is a node group having the same root node as the current node group in the standard BOM. If a matching node group having the same root node as the current node group cannot be extracted in the standard BOM, a verification result modified with respect to the standard node group is generated.
The flexible storage method for BOM orders of the application further comprises the following steps: in the case of standard BOM upgrades, to avoid affecting the production order associated therewith, a standard BOM backup of the original version is automatically generated and the production order association associated with the original standard BOM is registered to the standard BOM backup.
Referring to FIG. 2, the present application also provides a flexible storage system for BOM orders, comprising:
a production order editing unit for editing a production order by a user calling a standard BOM;
the BOM modification verification unit is used for executing BOM modification verification when the production order edited by the user is stored;
the BOM management unit is used for carrying out associated registration on the production order and the standard BOM for the production order of the verified unmodified standard BOM, and the BOM for the production order is not stored separately; generating and storing a production order special BOM for the production order of which the standard BOM is verified and modified;
and the BOM library is used for storing standard BOMs and production order special BOMs.
The BOM management unit is used for locating the modified nodes in the BOM hierarchical data structure through a rapid node locating and matching analysis algorithm.
The BOM management unit specifically comprises:
the node group dividing unit is used for dividing the BOM of the production order edited by the user into Q node groups when the production order is stored; each node group includes a root node at a particular level in the BOM data structure and its lower nodes.
A check load calculation unit for extracting k node groups from the Q node groups at a time, estimating the check load of each node group, and setting the k node groups according to the check load L i Is ordered in descending order of size.
A check queue unit including multiple check queues { G }, a plurality of check queues { G min ,…G max According to having been put intoCheck load of node group of check queue, G is arranged in ascending order from small to large min Check queue representing minimum check load, G max A check queue with the maximum check load is represented; and put k node groups into check queue { G }, in order min ,…G max The node group with the largest check load in the current k node groups is added to a check queue with the smallest check load; and vice versa, the node group with the smallest check load in the current k node groups is added to the check queue with the largest check load, and each updated check queue is output.
A checking thread unit, which establishes a checking thread executed in parallel for each checking queue; each verification thread extracts a matching node group from the standard BOM for the current node group in its corresponding verification queue and verifies whether the current node group has a modification with respect to the matching node group of the standard BOM.
Wherein in case of standard BOM upgrades, the BOM management unit automatically generates a standard BOM backup of the original version and registers the production order association associated with the original standard BOM to the standard BOM backup in order to avoid affecting the production order associated therewith.
According to the application, by adding the BOM modification and verification link, the repeated storage of the standard BOM is avoided, thereby avoiding redundant data and reducing the system load; in the modification and verification process, through a rapid node positioning and matching analysis algorithm, the verification speed is improved, no larger delay is generated, and the user experience is ensured; in the case of standard BOM version updates, it is ensured that the production order associated therewith is not affected, and the reliability of the system is improved.
The foregoing is merely illustrative of the present application, and the present application is not limited thereto, and any changes or substitutions easily contemplated by those skilled in the art within the scope of the present application should be included in the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A flexible storage method for BOM orders, comprising the steps of:
invoking a standard BOM by a user to edit the production order;
executing BOM modification verification when saving a production order edited by a user;
for a production order of the verified unmodified standard BOM, performing associated registration on the production order and the standard BOM, and not storing the BOM for the production order separately;
for production orders for which the standard BOM is verified and modified, a production order specific BOM is generated and saved.
2. Method according to claim 1, characterized in that in the case of a standard BOM upgrade, in order to avoid affecting the production order associated therewith, a standard BOM backup of the original version is automatically generated and the production order association associated with the original standard BOM is registered to the standard BOM backup.
3. The method of claim 1, wherein in the BOM modification verification, a modified node in a BOM hierarchical data structure is located by a fast node locating and matching analysis algorithm.
4. A method according to claim 3, wherein the fast node location and matching analysis algorithm comprises the steps of:
s201, dividing BOM of a production order edited by a user into Q node groups during storage; each node group comprises a root node and a lower node thereof, wherein the root node is positioned at a specific level in the BOM data structure;
s202, k node groups are taken out from the Q node groups at a time, and the verification load of each node group is estimated;
s203, the k node groups are subjected to verification load L i Is ordered in descending order of size;
s204, sequentially placing k node groups into a check queue { G } min ,…G max In }; wherein, according to the fact that the check team is put inThe check load of the node groups of the columns are arranged in ascending order from small to large, G min Check queue representing minimum check load, G max A check queue with the maximum check load is represented; the node group with the largest verification load in the current k node groups is added to a verification queue with the smallest verification load; the node group with the smallest check load in the current k node groups is added to a check queue with the largest check load; outputting each updated check queue;
s205, judging whether all Q node groups have been traversed; if it has already been traversed, step S206 is entered; if not, returning to the step S202, and starting the next iteration;
step S206, establishing a parallel execution check thread for each check queue;
in step S207, each verification thread extracts a matching node group from the standard BOM for the current node group in its corresponding verification queue, and verifies whether the current node group has a modification with respect to the matching node group of the standard BOM.
5. The method of claim 4, wherein the load calculation formula for each node group is as follows:
L i ＝fl(node i )
wherein L is i Representing the estimated check load of the ith node group in the k node groups, node i Representing the number of BOM data structure nodes contained within the ith node group, the function fl (·) represents an estimated function from the number of nodes within the node group to the check load.
6. The method of claim 5, wherein the set of matching nodes in the standard BOM is a set of nodes in the standard BOM that have the same root node as the current set of nodes.
7. The method of claim 6, wherein if a matching node group having the same root node as the current node group cannot be extracted in the standard BOM, generating a verification result modified with respect to the standard node group.
8. A flexible storage system for BOM orders, comprising:
a production order editing unit for editing a production order by a user calling a standard BOM;
the BOM modification verification unit is used for executing BOM modification verification when the production order edited by the user is stored;
the BOM management unit is used for carrying out associated registration on the production order and the standard BOM for the production order of the verified unmodified standard BOM, and the BOM for the production order is not stored separately; generating and storing a production order special BOM for the production order of which the standard BOM is verified and modified;
and the BOM library is used for storing standard BOMs and production order special BOMs.
9. The system of claim 8, wherein in the event of a standard BOM upgrade, the BOM management unit automatically generates a standard BOM backup of the original version and registers the production order association associated with the original standard BOM to the standard BOM backup in order to avoid affecting the production order associated therewith.
10. The system of claim 8, wherein the BOM management unit specifically comprises:
the node group dividing unit is used for dividing the BOM of the production order edited by the user into Q node groups when the production order is stored; each node group includes a root node at a particular level in the BOM data structure and its lower nodes.
A check load calculation unit for extracting k node groups from the Q node groups at a time, estimating the check load of each node group, and setting the k node groups according to the check load L i Is ordered in descending order of size.
A check queue unit including multiple check queues { G }, a plurality of check queues { G min ,…G max In which the node groups are arranged in ascending order from small to large according to the check load of the node groups which have been put into the check queueColumns, G min Check queue representing minimum check load, G max A check queue with the maximum check load is represented; and put k node groups into check queue { G }, in order min ,…G max The node group with the largest check load in the current k node groups is added to a check queue with the smallest check load; and vice versa, the node group with the smallest check load in the current k node groups is added to the check queue with the largest check load, and each updated check queue is output.
A checking thread unit, which establishes a checking thread executed in parallel for each checking queue; each verification thread extracts a matching node group from the standard BOM for the current node group in its corresponding verification queue and verifies whether the current node group has a modification with respect to the matching node group of the standard BOM.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310955277.9A CN117093144B (en) | 2023-07-31 | 2023-07-31 | Flexible storage method and system for BOM order |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310955277.9A CN117093144B (en) | 2023-07-31 | 2023-07-31 | Flexible storage method and system for BOM order |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117093144A true CN117093144A (en) | 2023-11-21 |
| CN117093144B CN117093144B (en) | 2024-06-18 |
Family
ID=88774405
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310955277.9A Active CN117093144B (en) | 2023-07-31 | 2023-07-31 | Flexible storage method and system for BOM order |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117093144B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102208063A (en) * | 2011-06-03 | 2011-10-05 | 用友软件股份有限公司 | Task data generating device and task data generating method |
| CN102567818A (en) * | 2010-12-08 | 2012-07-11 | 金蝶软件（中国）有限公司 | Method for generating order bill of material and system thereof |
| CN105678498A (en) * | 2016-02-26 | 2016-06-15 | 浪潮通用软件有限公司 | BOM implementation method for automatic matching based on features |
| CN105787612A (en) * | 2014-12-18 | 2016-07-20 | 金蝶软件（中国）有限公司 | BOM (bill of material) data comparison method and system |
| CN113112330A (en) * | 2021-04-23 | 2021-07-13 | 北京嘀嘀无限科技发展有限公司 | Travel order processing method, device, equipment, storage medium and product |
| CN114185878A (en) * | 2021-11-15 | 2022-03-15 | 成都四方伟业软件股份有限公司 | Method and device for generating data verification based on field definition |
| CN114282862A (en) * | 2021-12-07 | 2022-04-05 | 江苏满运物流信息有限公司 | Repeated freight order processing method and device, electronic equipment and storage medium |
| CN114372802A (en) * | 2021-12-02 | 2022-04-19 | 格莱杰(深圳)科技有限公司 | Purchase and sale contract generation method, device, equipment and storage medium |
| CN114724170A (en) * | 2022-04-06 | 2022-07-08 | 宝联智原(大连)科技有限公司 | BOM generation method and device, electronic equipment and storage medium |
| CN116468347A (en) * | 2023-04-18 | 2023-07-21 | 上海东普信息科技有限公司 | Order information synchronization method, device, equipment and storage medium |
-
2023
- 2023-07-31 CN CN202310955277.9A patent/CN117093144B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102567818A (en) * | 2010-12-08 | 2012-07-11 | 金蝶软件（中国）有限公司 | Method for generating order bill of material and system thereof |
| CN102208063A (en) * | 2011-06-03 | 2011-10-05 | 用友软件股份有限公司 | Task data generating device and task data generating method |
| CN105787612A (en) * | 2014-12-18 | 2016-07-20 | 金蝶软件（中国）有限公司 | BOM (bill of material) data comparison method and system |
| CN105678498A (en) * | 2016-02-26 | 2016-06-15 | 浪潮通用软件有限公司 | BOM implementation method for automatic matching based on features |
| CN113112330A (en) * | 2021-04-23 | 2021-07-13 | 北京嘀嘀无限科技发展有限公司 | Travel order processing method, device, equipment, storage medium and product |
| CN114185878A (en) * | 2021-11-15 | 2022-03-15 | 成都四方伟业软件股份有限公司 | Method and device for generating data verification based on field definition |
| CN114372802A (en) * | 2021-12-02 | 2022-04-19 | 格莱杰(深圳)科技有限公司 | Purchase and sale contract generation method, device, equipment and storage medium |
| CN114282862A (en) * | 2021-12-07 | 2022-04-05 | 江苏满运物流信息有限公司 | Repeated freight order processing method and device, electronic equipment and storage medium |
| CN114724170A (en) * | 2022-04-06 | 2022-07-08 | 宝联智原(大连)科技有限公司 | BOM generation method and device, electronic equipment and storage medium |
| CN116468347A (en) * | 2023-04-18 | 2023-07-21 | 上海东普信息科技有限公司 | Order information synchronization method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117093144B (en) | 2024-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7418453B2 (en) | Updating a data warehouse schema based on changes in an observation model | |
| CN102236672B (en) | A kind of data lead-in method and device | |
| EP1913451B1 (en) | Server-side project manager | |
| US6021396A (en) | Method to provide sensitivity information for (R,s,S) inventory systems with back-ordered demand | |
| US20090100419A1 (en) | Method for determining priority for installing a patch into multiple patch recipients of a network | |
| US20080301181A1 (en) | System and method for creating an object model | |
| EP1862956A1 (en) | Systems and methods for assignment generation in a value flow environment | |
| US8626703B2 (en) | Enterprise resource planning (ERP) system change data capture | |
| WO2006082432A2 (en) | Time-series forecasting | |
| WO2010058222A2 (en) | Updating data within a business planning tool | |
| US8244644B2 (en) | Supply chain multi-dimensional serial containment process | |
| CN115993966B (en) | Application development system and method | |
| JP4848128B2 (en) | Database system, computer-executable method for database system, program and method for updating index table in database system | |
| CN101046822B (en) | Centralized management of data nodes | |
| EP2315138A1 (en) | Improving performance of a manufacturing execution system | |
| CN117093144B (en) | Flexible storage method and system for BOM order | |
| CN116167882A (en) | Conditional expression dynamic configuration method, accounting condition calculation method and accounting condition calculation device | |
| WO2013061324A2 (en) | A method for estimating the total cost of ownership (tcp) for a requirement | |
| US20110185167A1 (en) | Change impact research support device and change impact research support method | |
| JP5336906B2 (en) | Design process management device | |
| CN110968363A (en) | Data configuration synchronization method and device, electronic equipment and readable storage medium | |
| US20170185485A1 (en) | Method and system for cloud parallelization of recursive lifing calculations | |
| CN111078750A (en) | Data statistical method and device of project model and computer storage medium | |
| US20110246249A1 (en) | Simulation of supply chain plans using web service | |
| CN112381228B (en) | Knowledge system construction and application method based on business |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |