CN110009180B - Punctual production control method based on block chain - Google Patents

Punctual production control method based on block chain Download PDF

Info

Publication number
CN110009180B
CN110009180B CN201910061234.XA CN201910061234A CN110009180B CN 110009180 B CN110009180 B CN 110009180B CN 201910061234 A CN201910061234 A CN 201910061234A CN 110009180 B CN110009180 B CN 110009180B
Authority
CN
China
Prior art keywords
production
block
logistics node
chain
logistics
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.)
Active
Application number
CN201910061234.XA
Other languages
Chinese (zh)
Other versions
CN110009180A (en
Inventor
谢兆贤
倪建成
高仲合
高峰
柯志鸿
谢和峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Anhui Hefeng Supply Chain Holdings Co.,Ltd.
Original Assignee
Qufu Normal University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Qufu Normal University filed Critical Qufu Normal University
Priority to CN201910061234.XA priority Critical patent/CN110009180B/en
Publication of CN110009180A publication Critical patent/CN110009180A/en
Application granted granted Critical
Publication of CN110009180B publication Critical patent/CN110009180B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315Needs-based resource requirements planning or analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04Manufacturing
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Manufacturing & Machinery (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • General Factory Administration (AREA)

Abstract

The invention discloses a block chain-based punctual production control method, which comprises the following steps: 1) the method comprises the steps of establishing a block chain main chain in the production process by taking each process as a unit, setting logistics nodes with the number corresponding to the processes, establishing a production relationship among adjacent logistics nodes, judging whether the production conditions of the logistics nodes in the subsequent process are met or not at present after the logistics nodes in the prior process acquire and execute the task requests of the logistics nodes in the subsequent process, acquiring the proportion L of the output of each sub-chain of the logistics nodes in the prior process by utilizing a workload-proven consensus mechanism, feeding back the semi-finished product input proportion of each sub-chain according to the acquired proportion L, preferentially supplying the semi-finished products in sequence, referring to the block chain technology, rapidly solving the state of response on-time production by using a distributed architecture, providing suppliers, customers and production personnel with knowledge about the production state, not only keeping the safety of each sub-chain, but also facilitating real-time management (high reliability) of production, further reducing production and inventory costs.

Description

Punctual production control method based on block chain
Technical Field
The invention relates to the field of information management, in particular to a block chain-based punctual production control method.
Background
Real-time production technology (JIT), also known as Just-in-time production, is a production management methodology that improves commercial return on investment by reducing inventory and associated attendant costs during production. Briefly, the main goal of just-in-time institutional is to have the right material flow to the right place at the right time, in just-good quantities.
In order to meet the aim of punctual system, the production process relies on mark symbols, or billboard management, which is used for telling workers when to proceed with the next process. Generally, the billboard may also be a simple visual symbol instead. JIT can help enterprises to continuously improve production processes, and increase return on investment, quality, efficiency, employee participation, and product flow rate of productive enterprises. And resource waste caused by inventory is reduced. The JIT inventory system recognizes that inventory represents an implicit cost, and thus efficient enterprises do not have inventory issues. First, the just-in-time production system encourages enterprises to gradually eliminate inventory, reducing costs in the production flow. Then, the management is gradually adapted to the "zero stock" state.
Three principles of cost reduction and waste reduction are formulated by a punctual production system.
One, time cost-time wasted in the manufacturing process.
Second, inventory cost-product retained during manufacturing.
Third, idle cost — in the state where the machine cannot move during the manufacturing process, the machine is still in idle running continuously.
The conventional production method is a push-type production, such as the conventional manufacturing flow chart of fig. 1. FIG. 2 is a flow chart of the manufacture of Just In Time (JIT) during the pull-type production process, In which the input semi-finished product is obtained from the back end to the front end. This production method has two characteristics, (1) one-to-one; (2) just the demand can both be on time, reduces the stock and reaches and reduce whole manufacturing cost.
But JIT production suffers from (1) a delay in the last station that causes downtime. (2) The productivity increase of the last station causes a disadvantage of increase of WIP (semi-finished product). And the problem of delay therein cannot be dealt with.
And the improvement of JIT will cause a new problem as shown in fig. 3. For example: problem condition after JIT improvement. The groups S21 and S22 have two states, one is to produce the same product, in order to accelerate the production efficiency. Another is to produce different products in order to be assembled into a semi-finished product at the next station. And thirdly, the workstations in the same level can mutually support production. The first state is considered by this patent because it is most widely used. Here, S41, S42, and S43 are the same group. S5 will ask series S4 for the desired product and quantity; the S4 series will require the required product and quantity from S3, distributed to the workstations within the series; s3 will ask series S2 for the desired product and quantity; the S2 series will require the desired product and quantity from S1, distributed to the stations within the series. The whole production mode belongs to JIT pull type production, and a semi-finished product is input from the back end like the front end with a first-level requirement.
Continuing with the above example, the requirement of S5 is 10, and three jobs S41, S42, S43 are required to satisfy the total of 10 in total production quantity. Perhaps the average production volume is predicted to be (x ', y ', z ') = (3, 3, 4), but the actual production volume will not be readily known. The reason is that the number of semifinished products (x, y, z) respectively input is not easily measured, and we know that x + y + z should be at least 10, which would be expected to meet the requirement of S5 without any disadvantages.
The following two models can be derived from the conventional just-in-time production system.
Supplier management inventory
The principles of Vendor Managed Inventory (VMI) are similar to those of just-in-time production regimes. The person managing the inventory is the retailer and not the producer, and the ultimate management role is attributed to the retailer, whether the producer manages the inventory of the retailer or the retailer manages the inventory of the producer.
The advantage of this business model is that retailers can gain experience with the production segment, allowing them to better predict the amount of demand and the inventory they need. Inventory planning and control can use simple application software to feed the inventory data of the retailer back to the production line at any time.
(II) customer management inventory
Customer Managed Inventory (CMI) systems, unlike retailers, allow customers the right to determine inventory. This is similar to the concept of an on-time production system, where large customers can predict demand and thus keep production lines and retailers aware of at any time to manage inventory.
Both of the above methods require a centralized host to be built for service. The problem of centralized computing still exists, if in a large manufacturing environment, hundreds of workstations, thousands of component manufacturing environments, such as automobiles, are required. The problem of punctual access to the data will be excessive, and if the computing power of the host server is insufficient or the database has poor performance in processing the excessive data, the problem will be serious. In addition, each workstation will only be able to process batch-type JIT, and cannot accurately manage production quantity and set up material preparation requirements.
Disclosure of Invention
In view of the above problems, the present invention provides a block chain-based on-time production control method.
In order to achieve the above object, the present invention provides a block chain-based on-time production control method, which includes the following steps:
1) establishing a block chain main chain in the production process by taking each process as a unit, setting logistics nodes with the number corresponding to that of the processes, and establishing a production relation between each adjacent logistics node;
2) respectively establishing a plurality of sub-chains aiming at each process, wherein the sub-chains in the same process respectively correspond to the same logistics node;
3) the method comprises the following steps that a corresponding production relation exists between two adjacent logistics nodes, and after a logistics node in a prior process acquires and executes a task request of a logistics node in a subsequent process, whether the production condition of the logistics node in the subsequent process is met or not is judged;
4) if the production conditions of the subsequent logistics node are met, acquiring a semi-finished product of the prior logistics node at the subsequent logistics node, stopping production at the prior logistics node, and if the production conditions of the subsequent logistics node cannot be met, continuing production at the prior logistics node;
5) meanwhile, the prior logistics node sends the self data and the block hash information to the subsequent logistics node, and the subsequent logistics node stores the self data and the block hash information;
6) each logistics node at the main chain of the block chain is processed according to the steps 3) to 5) respectively to finish the production of the whole product,
simultaneously, the main chain and the sub chain of the block chain are both provided with intelligent contracts to provide the function of stock inquiry,
in the step 3), a recognition mechanism proved by workload is utilized to obtain a ratio L of the output of each subchain of the prior logistics node, and the semi-finished product input ratio of each subchain is formed by feedback according to the obtained ratio L and is preferentially supplied in sequence.
Each logistics node has an output interface for output of production data and an input interface for input of production data.
Each logistics node comprises a first block and a second block, wherein the first block is used for representing production information, and the second block is used for representing inventory information.
The first block acquires and executes the task request of the second block, and then judges whether the inventory requirement of the second block is met currently, if so, the second block acquires the semi-finished product of the first block, and meanwhile, the first block stops production, and if not, the first block continues production.
The first block is composed of a number of sub-chains.
The invention has the beneficial effects that: the technology of the block chain is introduced, the state of the on-time production is quickly reflected by a distributed architecture, a supplier, a customer and a production person are provided to know the production state, the safety of information is kept (the information is not easy to be independently modified), and the production can be conveniently managed in real time (the reliability is high), so that the production and inventory cost is further reduced.
Drawings
Fig. 1 is a schematic view of a conventional manufacturing process.
FIG. 2 is a schematic diagram of the Just In Time (JIT) manufacturing process.
Fig. 3 is a schematic diagram of an improved JIT manufacturing process.
Fig. 4 is a block chain logistics node relationship diagram.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that all the directional indicators (such as up, down, left, right, front, and rear … …) in the embodiment of the present invention are only used to explain the relative position relationship between the components, the movement situation, etc. in a specific posture (as shown in the drawing), and if the specific posture is changed, the directional indicator is changed accordingly.
In the present invention, unless otherwise expressly stated or limited, the terms "connected," "secured," and the like are to be construed broadly, and for example, "secured" may be a fixed connection, a removable connection, or an integral part; can be mechanically or electrically connected; they may be directly connected or indirectly connected through intervening media, or they may be connected internally or in any other suitable relationship, unless expressly stated otherwise. The specific meanings of the above terms in the present invention can be understood by those skilled in the art according to specific situations.
In addition, the descriptions related to "first", "second", etc. in the present invention are only for descriptive purposes and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present invention.
The invention provides a block chain-based punctual production control method, which comprises the following steps:
1) establishing a block chain main chain in the production process by taking each process as a unit, setting logistics nodes with the number corresponding to that of the processes, and establishing a production relation between each adjacent logistics node;
2) respectively establishing a plurality of sub-chains aiming at each process, wherein the sub-chains in the same process respectively correspond to the same logistics node;
3) the method comprises the following steps that a corresponding production relation exists between two adjacent logistics nodes, and after a logistics node in a prior process acquires and executes a task request of a logistics node in a subsequent process, whether the production condition of the logistics node in the subsequent process is met or not is judged;
4) if the production conditions of the subsequent logistics node are met, acquiring a semi-finished product of the prior logistics node at the subsequent logistics node, stopping production at the prior logistics node, and if the production conditions of the subsequent logistics node cannot be met, continuing production at the prior logistics node;
5) meanwhile, the prior logistics node sends the self data and the block hash information to the subsequent logistics node, and the subsequent logistics node stores the obtained self data and the block hash information;
6) each logistics node at the main chain of the block chain is processed according to the steps 3) to 5) respectively to finish the production of the whole product,
and simultaneously, intelligent contracts are deployed on the main chain and the sub-chains of the blockchain, so that the inventory query function is provided.
In the same manufacturing system, no matter how many sub-workstations (same production mode) are under each workstation, a logistics node is built to participate in an intelligent contract. The forward request for new semifinished products is stopped when a sufficient total number can be collected immediately by the latter station, thereby achieving a time and yield optimized characteristic.
Each block is internally provided with a block information processing unit, and an information acquisition block base station in the block information processing unit is an information aggregation device and is used for aggregating information and establishing a corresponding Hash tree (Hash) relation for the sensing record in the range. The wireless sensor network contains the recorded contents of all the sensors in the block. The block chain encrypts transactions in a transaction block through a hash algorithm, compressing the messages into a hash string of numbers and letters. Any node in the block chain can obtain a corresponding hash value through simple hash calculation. If the computed hash value does not change, it indicates that the message in the block has not been modified. Under the sequential block setting, each block is synchronously performing their own work.
Each logistics node has an output interface for output of production data and an input interface for input of production data.
Each logistics node comprises a first block and a second block, wherein the first block is used for representing production information, and the second block is used for representing inventory information.
The first block acquires and executes the task request of the second block, and then judges whether the inventory requirement of the second block is met currently, if so, the second block acquires the semi-finished product of the first block, and meanwhile, the first block stops production, and if not, the first block continues production.
The first block is composed of a plurality of sub-chains, each sub-chain can also be provided with a main chain which is used as a final process, and the main chain is sequentially subjected to the operations, so that the block chain arrangement of the process flow of the whole process is realized.
Among the block chain theories, there is an important property. The reason for this is that the security is because of the 'consensus mechanism', in a simple way, the data in the block chain is copied to all nodes, and if someone only modifies the data on one production machine and the records on other production machines are not modified, this action will fail. Unless the data on the production machine is modified by more than 50% of all machines, the data represents consensus, and the data is successful. However, in the blockchain world, it is difficult to find 50% of the correlation and modify it, so the data is highly secure.
Although common consensus mechanisms are represented by three types of Proof of workload (Proof of Work, PoW), Proof of rights and interests (Proof of stamp, PoS), and Proof of authority of shares (DPoS). PoW is a result of the number of jobs, and PoS is divided by different weights, DPoS and PoS are similar to the weighting, and the difference is a generation block with probability variation in a predetermined time period.
Continuing with the previous two problem paradigm, the requirement of S5 is 10, requiring three jobs S41, S42, S43 to meet the total of 10. During production, we may predict that the average production is (x ', y ', z ') = (3, 3, 4), but the actual production under "consensus mechanism" will not easily match the amount we predict. Intuitively, the ratio of the number of semi-finished products input individually is x: y: z =3:3: 4. To meet the requirements of the prospective S5, our consensus mechanism invokes a workload proof method to assign x, y, z in terms of production quantities.
Therefore, including the possibility of failure, the ratio of the x, y, z quantities will be fed back to the x, y, z quantity ratio in the proportion of the quantities produced per unit time of x ', y ', z '.
For example:
(x ', y', z ') = (1,1,1), and the production amount per unit time of x', y ', z' does not exceed all 51%, then the production amount of the previous S3 is sequentially (x, y, z) = (1,1,1) to perform the dispensing of the semi-finished products.
(x ', y ', z ') = (0,2,2), the production amount per unit time of y ', z ' exceeds all 51%, and the previous production amount of S3 is sequentially (x, y, z) = (0, 1,1) to distribute the semi-finished products. Since the ratio of y to z is the same, when a product is produced in S3, it becomes (x, y, z) = (0,2, 1); similarly, if S3 reproduces a product, it becomes (x, y, z) = (0,2,2), and so on.
Example 1, the number of workstation inputs corresponds to the number of outputs. Consistent quantities represent no inventory, no defective products, and no work in process. We call stock, defective products, and Work In Process (WIP) which is the same as the work In Process, and the number of products entering the workstation is the same as the number of products exiting the workstation. Possible variations in the production process at each workstation, including quality checks, are not expected to affect the total number of products completed within a unit production. In the relationship between the S4 stations (S41, S42, S43) and S5, if S5 requires 10 semi-finished products, it may be that three sub-stations S41, S42, S43 output semi-finished products, the total number of which is at least 10. According to the production record of the block chain, the sequence is S41 → S42 → S41 → S42 → S43 → S43 → S43 → S41 → S42 → S42. In other words, regardless of the input number of the sub-stations S41, S42 and S43, when the total number reaches at least 10, the requirement will be fed back and the continuous forward lowering of the semi-finished products according to the requirements of the stations will be stopped.
In the workstation of S4, if there are several stages to record the production completion number of each sub-workstation, the production number of different stages will be different due to the change of the workstation process personnel or machine, and the manufacturing will be stopped by the feedback blockchain message when the total number received in S5 reaches 10.
If the input and output of each work station meet the state, the input of the semi-finished product process, the negative sign of which represents the insufficient quantity, can be fed back to the previous work station to require the continuous production of the residual quantity until the total quantity meets the state. 0 represents that the input meets the expected demand.
Example 2 the number of workstation inputs does not correspond to the number of outputs. Representing the existence of inventory, defective products, or work in process, i.e., the number of entries into the workstation is not equal to the number of output workstations. Even if the input of the previous sub-workstation is far more than the output, as long as the requirement of the workstation is not met, the previous workstation continuously and repeatedly requires the previous workstation to continuously input qualified semi-finished products so as to facilitate the production of the previous workstation, and the qualified semi-finished products are output to the workstation.
And the state of the input satisfaction and the output satisfaction of each work station is input into the semi-finished product process, the negative sign represents the insufficient quantity, the quantity is fed back to the last work station, and the residual quantity is required to be continuously produced until the total quantity is satisfied. 0 represents that the input meets the expected demand for the product quantity.
This case shows that processes with defective or in-process products are classified as WIP, and so the "yield to be replenished" refers to the amount of material that needs to be replenished to the next station, regardless of whether WIP is present or not, typically after the input is satisfied.
Total number of production results per unit time for each station. This time unit QUOTE
Figure DEST_PATH_IMAGE002
Figure DEST_PATH_IMAGE002A
To customize the production time of a product, for example: under a work station S4 there are three sub-work stations, S41, S42, S43 for which the time to produce a semi-finished product is QUOTE
Figure DEST_PATH_IMAGE002AA
Figure DEST_PATH_IMAGE002AAA
Then, on average, 3. The following is the definition and description of the relevant parameters of the workstation of S4, and so on.
(1) The inputs to the workstations S41, S42, S43 are satisfied by the quantities x ', y ', z '. x ', y ', z ' ∈ [1, ∞).
(2) The outputs of the workstations S41, S42, S43 satisfy the number x, y, z. x, y, z ∈ [1, ∞ ].
(3) Number of work in progress for workstations S41, S42, S43x wip ,y wip ,z wip ∈[0,∞)。
(4) According to the above relationship, x ' is not less than 1 and not more than x, y ' is not less than 1 and not more than y, and z ' is not less than 1 and not more than z.
(5) The number of workstations, x '+ y' + z '≧ a', is entered per unit time for the child workstations S41, S42, S43. The number of the work stations input in unit time is a ' (1 ≦ a ' less than b '). Where a 'is the sub-station number within the station and b' is the total number of sub-stations. a ', b'
Figure DEST_PATH_IMAGE004
(6) The sub-stations S41, S42, S43 output the number of stations x + y + z = a per unit time. The number of the output workstations per unit time is a: (
Figure DEST_PATH_IMAGE006
). Where a is the sub-station number within the station and b is the total number of sub-stations.
Figure DEST_PATH_IMAGE008
The procedure of the example is as follows
Step 1, creating a block chain. Each sub-station establishes a corresponding message node for an input production and an output production in accordance with the sequence of the JIT manufacturing job.
And 2, inputting the number a', a ∈ [0, ∞ ] of the workstation.
And step 3, carrying out the number a output by the workstation, wherein a belongs to [0, ∞ ].
And 4, updating the value of a'. The expected demand ρ for each workstation is known.
Step 4-1, obtaining Σ (x '+ y' + z '), obtaining x' according to the consensus mechanism of the workload certification: y': z' the proportion L, L of the production quantity is more than 51 percent,
Step 4-2, according to x': y': z', the feedback forming the semi-finished product input ratios of the various sub-stations x, y, z, to be supplied sequentially with priority.
Step 4-3, if the sum of sigma (x ' + y ' + z ') is less than 0 (the input is not satisfied); the last workstation request is fed back to make up an amount less than 0.
Step 4-4, if the sum of sigma (x ' + y ' + z ') is more than or equal to 0 (input satisfaction is achieved); the last workstation is fed back to stop production.
4-4-1, if the number of WIPs is more than 0; the last workstation request is fed back to make up the amount of WIP. The yield to be compensated is set equal to the number of WIPs.
4-4-2, if the number of WIPs is less than or equal to 0; then no consideration is needed and no inventory issues are represented.
Step 4-5, if
Figure DEST_PATH_IMAGE010
The total sum of (1) is more than or equal to 0 (input is achieved to meet) and the output to be compensated is less than 0; the last workstation request is fed back to make up an amount less than 0.
Step 4-6, if
Figure 249325DEST_PATH_IMAGE010
The total sum of (a) is more than or equal to 0 (input is achieved to meet) and the yield to be compensated is 0; the workstation stops production.
The examples should not be construed as limiting the present invention, but any modifications made based on the spirit of the present invention should be within the scope of protection of the present invention.

Claims (5)

1. A block chain-based punctual production control method is characterized in that: which comprises the following steps:
1) establishing a block chain main chain in the production process by taking each process as a unit, setting logistics nodes with the number corresponding to that of the processes, and establishing a production relation between each adjacent logistics node;
2) respectively establishing a plurality of sub-chains aiming at each process, wherein the sub-chains in the same process respectively correspond to the same logistics node;
3) the method comprises the following steps that a corresponding production relation exists between two adjacent logistics nodes, and after a logistics node in a prior process acquires and executes a task request of a logistics node in a subsequent process, whether the production condition of the logistics node in the subsequent process is met or not is judged;
4) if the production conditions of the subsequent logistics node are met, acquiring a semi-finished product of the prior logistics node at the subsequent logistics node, stopping production at the prior logistics node, and if the production conditions of the subsequent logistics node cannot be met, continuing production at the prior logistics node;
5) meanwhile, the prior logistics node sends the self data and the block hash information to the subsequent logistics node, and the subsequent logistics node stores the self data and the block hash information;
6) each logistics node at the main chain of the block chain is processed according to the steps 3) to 5) respectively to finish the production of the whole product,
simultaneously, the main chain and the sub chain of the block chain are both provided with intelligent contracts to provide the function of stock inquiry,
in the step 3), a recognition mechanism proved by workload is utilized to obtain a ratio L of the output of each subchain of the prior logistics node, and the semi-finished product input ratio of each subchain is formed by feedback according to the obtained ratio L and is preferentially supplied in sequence.
2. The block chain-based on-time production control method according to claim 1, wherein: each logistics node has an output interface for output of production data and an input interface for input of production data.
3. The block chain-based on-time production control method according to claim 1, wherein: each logistics node comprises a first block and a second block, wherein the first block is used for representing production information, and the second block is used for representing inventory information.
4. The block chain-based on-time production control method according to claim 3, wherein: the first block acquires and executes the task request of the second block, and then judges whether the inventory requirement of the second block is met currently, if so, the second block acquires the semi-finished product of the first block, and meanwhile, the first block stops production, and if not, the first block continues production.
5. The block chain-based on-time production control method according to claim 3, wherein: the first block is composed of a number of sub-chains.
CN201910061234.XA 2019-01-23 2019-01-23 Punctual production control method based on block chain Active CN110009180B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910061234.XA CN110009180B (en) 2019-01-23 2019-01-23 Punctual production control method based on block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910061234.XA CN110009180B (en) 2019-01-23 2019-01-23 Punctual production control method based on block chain

Publications (2)

Publication Number Publication Date
CN110009180A CN110009180A (en) 2019-07-12
CN110009180B true CN110009180B (en) 2020-12-22

Family

ID=67165571

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910061234.XA Active CN110009180B (en) 2019-01-23 2019-01-23 Punctual production control method based on block chain

Country Status (1)

Country Link
CN (1) CN110009180B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111461914A (en) * 2020-03-31 2020-07-28 深圳点链科技有限公司 Order tracking verification and cancellation management method, system and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1395202A (en) * 2001-07-11 2003-02-05 神达电脑股份有限公司 Warehousing and storage system with optimum management process
CN107079059A (en) * 2016-12-21 2017-08-18 深圳前海达闼云端智能科技有限公司 Block chain storage method and device and node equipment
CN108432176A (en) * 2015-08-11 2018-08-21 J·斯托曼 The system and method for ensuring assets and supply chain integrality
CN108629564A (en) * 2018-04-28 2018-10-09 中国船舶重工集团公司第七〇九研究所 A kind of Management in Large Scale Project system and method based on block chain technology
CN108924252A (en) * 2018-07-31 2018-11-30 泰链(厦门)科技有限公司 Mitigate method, medium and the block catenary system of node storage load in block catenary system
CN109146372A (en) * 2018-04-26 2019-01-04 宏泰集团(厦门)有限公司 Global wisdom manufactures sales service system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1395202A (en) * 2001-07-11 2003-02-05 神达电脑股份有限公司 Warehousing and storage system with optimum management process
CN108432176A (en) * 2015-08-11 2018-08-21 J·斯托曼 The system and method for ensuring assets and supply chain integrality
CN107079059A (en) * 2016-12-21 2017-08-18 深圳前海达闼云端智能科技有限公司 Block chain storage method and device and node equipment
CN109146372A (en) * 2018-04-26 2019-01-04 宏泰集团(厦门)有限公司 Global wisdom manufactures sales service system
CN108629564A (en) * 2018-04-28 2018-10-09 中国船舶重工集团公司第七〇九研究所 A kind of Management in Large Scale Project system and method based on block chain technology
CN108924252A (en) * 2018-07-31 2018-11-30 泰链(厦门)科技有限公司 Mitigate method, medium and the block catenary system of node storage load in block catenary system

Also Published As

Publication number Publication date
CN110009180A (en) 2019-07-12

Similar Documents

Publication Publication Date Title
TWI394089B (en) Virtual production control system and method and computer program product thereof
JP2000176799A (en) Production planning and manufacturing planning system
Koh et al. Managing uncertainty in ERP-controlled manufacturing environments in SMEs
TWI400657B (en) Optimizing an inventory of a supply chain
US8712823B2 (en) System, method and program recording medium for supply capacity estimation
US7099726B2 (en) Production planning system
US20210073695A1 (en) Production scheduling system and method
US7039481B2 (en) Production planning system
CN107146039B (en) Multi-target cooperative control customized mixed-flow assembly production method and device
CN109429515A (en) Production line constitutes altering system and production line constitutes variation
CN107392736A (en) A kind of data processing method, device and equipment
CN106327053B (en) Construction method of weaving process recommendation model based on multi-mode set
Zhang et al. Big data driven decision-making for batch-based production systems
CN113487155A (en) Intelligent scheduling system for plastic industry
WO2021155772A1 (en) Production, supply and marketing linkage platform, method and system and computer storage medium
CN110009180B (en) Punctual production control method based on block chain
US7493184B2 (en) Available to promise allocation optimization tool
CN116451974B (en) Method and system for managing digital factory business
TWM567403U (en) Intelligent scheduling system
Zheng et al. Comparative study on push and pull production system based on Anylogic
CN110032149A (en) Method for monitoring and controlling the cost of energy of the production of product batches
US20220327562A1 (en) Methods and systems for applying survival analysis models to produce temporal measures of sales productivity
TWI852171B (en) Forecast data processing system and forecast data processing method
CN112381396B (en) Integrated management method and system for serving enterprise development planning
CN114707702A (en) Large-scale customized full-period multi-objective optimization method based on two-stage planning

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
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20221229

Address after: Room 2706, Furong Building, No. 6, Suixi Road, Luyang District, Hefei City, Anhui Province, 230000

Patentee after: Anhui Hefeng Supply Chain Holdings Co.,Ltd.

Address before: No. 57, Jingxuan West Road, Qufu, Jining City, Shandong Province

Patentee before: QUFU NORMAL University

TR01 Transfer of patent right