CN117744691A

CN117744691A - Bar code management method and system for circulation of injection molding workshop and warehouse

Info

Publication number: CN117744691A
Application number: CN202410188321.2A
Authority: CN
Inventors: 刘海胶; 李驰; 颜蔚东
Original assignee: Guangdong Tengwei Zhishu Technology Co ltd
Current assignee: Guangdong Tengwei Zhishu Technology Co ltd
Priority date: 2024-02-20
Filing date: 2024-02-20
Publication date: 2024-03-22
Anticipated expiration: 2044-02-20
Also published as: CN117744691B

Abstract

The invention discloses a bar code management method and a bar code management system for circulation of an injection molding workshop and a warehouse, and relates to the technical field of production warehouse management. The invention comprises a bar code generating unit, a workshop coding unit and a warehouse management unit, wherein the bar code generating unit obtains the conventional number of each type of plastic parts according to the number of each type of plastic parts in a workshop and a warehouse, which are obtained in real time; distributing a variety code and a serial number code pool for each variety of plastic parts according to the conventional number of each variety of plastic parts; assigning serial number codes to each plastic part according to the production sequence of the plastic parts in the corresponding serial number coding pool; respectively converting the category codes and the sequence number codes into category bar codes and sequence number bar codes, and recording the category bar codes and the sequence number bar codes in a recording code area to obtain identification bar codes of each plastic part of each category; and after the plastic part is moved out of the warehouse, recovering the serial number code of the removed plastic part. The invention avoids the problem of repeated identification bar codes and is convenient for production, storage and management.

Description

Bar code management method and system for circulation of injection molding workshop and warehouse

Technical Field

The invention belongs to the technical field of production warehouse management, and particularly relates to a bar code management method and system for circulation of an injection molding workshop and a warehouse.

Background

With the rapid development of industrial automation and information technology, the production efficiency of injection molding workshops has been significantly improved. Injection molding is a high-efficiency production mode and is widely applied to manufacturing of plastic products, including household appliances, automobile parts, daily necessities and the like.

In conventional circulation management of injection molding workshops and warehouses, material tracking and inventory management often rely on manual operations or simple electronic records, which easily lead to confusion in product information management. However, the bar code is a one-dimensional code, and the capacity of information is limited, so that it is difficult to assign a unique bar code to each plastic part in production stock, which easily leads to confusion in management.

Disclosure of Invention

The invention aims to provide a bar code management method and a bar code management system for circulation of an injection molding workshop and a warehouse, which are used for analyzing inventory of different types of plastic parts, so that the types of codes and serial number codes with different byte lengths are distributed to the different types of plastic parts, the problem of repeated identification bar codes is avoided, and the production and storage management is convenient.

In order to solve the technical problems, the invention is realized by the following technical scheme:

the invention provides a bar code management method for circulation of an injection molding workshop and a warehouse, which comprises the following steps of,

dividing a bar code area of the identification bar code into a start code area, a record code area, a separation code area, a check code area and a termination code area;

acquiring available coding digits of the recording code area;

acquiring the number of plastic parts of each type in workshops and warehouses in real time;

obtaining the conventional number of each type of plastic parts according to the number of each type of plastic parts in a workshop and a warehouse, which are obtained in real time;

distributing a variety code and a serial number code pool for each variety of plastic parts according to the conventional number of each variety of plastic parts;

assigning serial number codes to each plastic part according to the production sequence of the plastic parts in the corresponding serial number coding pool;

respectively converting the type code and the sequence number code into a type bar code and a sequence number bar code, recording the type bar code and the sequence number bar code in the recording code area, and separating the type bar code and the sequence number bar code by using the separation code area to obtain the identification bar code of each plastic part of each type;

and after the plastic part is moved out of the warehouse, recovering the serial number code of the removed plastic part.

The invention also discloses a bar code management method for the circulation of the injection molding workshop and the warehouse, which comprises the following steps,

after the injection molding part is produced, receiving an identification bar code;

and arranging the identification bar code on the corresponding plastic part.

acquiring a position code of each storage unit in the warehouse;

when the injection molding part moves into a warehouse to be stored in a storage unit, reading the identification bar code to obtain the type code and the serial number code of the plastic part;

binding the type code and the serial number code of the plastic part with the position code of the corresponding storage unit;

when the plastic part moves out of the warehouse, the identification bar code of the plastic part is read, the serial number code of the removed plastic part is recovered, and the serial number code is unbinding with the position code of the storage unit.

The invention also discloses a bar code management system for the circulation of the injection molding workshop and the warehouse, which comprises,

the bar code generating unit is used for dividing a bar code area for identifying the bar code into a start code area, a record code area, a separation code area, a check code area and a termination code area;

acquiring available coding digits of the recording code area;

after the plastic part is moved out of the warehouse, recovering the serial number code of the removed plastic part;

the workshop coding unit is used for receiving the identification bar code after the injection molding piece is produced;

arranging the identification bar code on the corresponding plastic part;

the warehouse management unit is used for acquiring the position code of each storage unit in the warehouse;

According to the invention, through analyzing the inventory of different types of plastic parts, in order to distribute the type codes and the sequence number codes with different byte lengths for the different types of plastic parts, the information bearing capacity is improved in a limited bar code area, the problem that the identification bar codes are repeated for the plastic parts of an injection molding workshop and a warehouse is effectively avoided, one code stream of the plastic parts from the workshop to the warehouse is realized, and the management confusion is avoided.

Of course, it is not necessary for any one product to practice the invention to achieve all of the advantages set forth above at the same time.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed for the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1 is a schematic diagram of functional units and information flow of an embodiment of a bar code management system for injection molding workshop and warehouse circulation according to the present invention;

FIG. 2 is a flowchart illustrating steps performed by the bar code generating unit according to an embodiment of the present invention;

FIG. 3 is a flowchart illustrating a procedure of a workshop coding unit according to an embodiment of the present invention;

FIG. 4 is a flowchart illustrating steps performed by the warehouse management unit according to an embodiment of the present invention;

FIG. 5 is a flowchart illustrating the step S3 according to an embodiment of the present invention;

FIG. 6 is a flowchart illustrating the step S32 according to an embodiment of the present invention;

FIG. 7 is a flowchart illustrating the step S325 according to an embodiment of the present invention;

FIG. 8 is a flowchart illustrating the steps of step S3254 according to an embodiment of the present invention;

FIG. 9 is a flowchart illustrating the step S4 according to an embodiment of the present invention;

fig. 10 is a flowchart illustrating a step flow of step S5 according to an embodiment of the invention.

In the drawings, the list of components represented by the various numbers is as follows:

1-bar code generating unit, 2-workshop coding unit and 3-warehouse management unit.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

It should be noted that the terms "first," "second," and the like herein are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that embodiments of the present application described herein may be implemented in sequences other than those illustrated or otherwise described herein. The implementations described in the following exemplary examples are not representative of all implementations consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present application as detailed in the accompanying claims.

In order to exert scale effect and lower production cost, the plastic parts of the same type are very large in production scale. This makes it difficult for the bar code to uniquely identify each stock plastic item that is huge in number and that changes in stock float. In order to avoid this problem, the present invention provides the following arrangement.

Referring to fig. 1 to 2, the present invention provides a barcode management system for circulation between an injection molding workshop and a warehouse, which may include a barcode generating unit 1, a workshop coding unit 2 and a warehouse management unit 3 in terms of functional interaction. After each plastic part is produced in an injection molding workshop, an identification bar code with a unique identification function is generated by a bar code generating unit 1. And the shop coding unit 2 sprays or sticks the identification bar code on the surface of the plastic part. The stock management function is realized when the plastic parts enter and exit the stock management unit 3.

The bar code is divided structurally into a start code area, a record code area, a separation code area, a check code area and a termination code area. Wherein the recording code area can record customized contents. Referring to fig. 3, in a specific operation, the barcode generating unit 1 performs step S1 to obtain the available encoding digits of the recording code area. Step S2 may then be performed to obtain the number of plastic parts of each type in the shop and warehouse in real time. Step S3 may be performed to obtain a conventional number of plastic parts for each type based on the number of plastic parts for each type in the shop and warehouse acquired in real time. Step S4 may be performed to assign a category code and a serial number code pool to each category of plastic parts according to the conventional number of each category of plastic parts. Step S5 can be executed to allocate serial number codes to each plastic part according to the production sequence of the plastic parts in accordance with the corresponding serial number coding pool. And step S6 can be executed to convert the type codes and the sequence number codes into type bar codes and sequence number bar codes respectively, and then record the type codes and the sequence number bar codes in a record code area, and separate the type bar codes and the sequence number bar codes by a separation code area to obtain the identification bar codes of each plastic part of each type. After the plastic part is moved out of the warehouse, the step S7 can be executed to recycle the serial number code of the removed plastic part, and the serial number code is recycled, but the serial number code is not confused with the plastic part circulation process and warehouse management after the plastic part is sold or destroyed.

Referring to fig. 3, after the injection molding is produced, the shop coding unit 2 may first execute step S011 to receive the identification barcode during the operation. Step S012 may be performed to set the identification barcode to the corresponding plastic part.

Referring to fig. 4, when the injection molding is moved into the warehouse to be stored in the storage unit, the warehouse management unit 3 may first perform step S021 to obtain the position code of each storage unit in the warehouse. Step S022 can be executed to read the identification bar code, and the type code and the serial number code of the plastic part are obtained. Step S023 may be executed to bind the type code and the serial number code of the plastic part with the position code of the corresponding storage unit. When the plastic part moves out of the warehouse, the step S024 can be executed to recover the serial number code of the removed plastic part and unbind the serial number code with the position code of the storage unit, namely, the corresponding storage unit is released again for subsequent use.

As shown in fig. 5, the number of plastic parts in stock varies depending on factors such as production schedule and sales status, but is generally stable within a certain range. On the other hand, the more numbers that need to be recorded, the more space is needed in the bar code, which results in insufficient locations for recording plastic part type information. In other words, the larger the conventional number of plastic parts, the less bar code space is available for their corresponding type codes, which requires assigning shorter type codes thereto. Before the class codes are distributed, the conventional number of plastic parts of each class needs to be calculated, so that the plastic parts are used regularly enough, and waste of corresponding serial number coding pools is avoided. Specifically, referring to fig. 5, step S31 may be performed to obtain the number of finished products of the plastic parts at different times according to the number of plastic parts in the workshops and the warehouse acquired in real time. Step S32 can be executed to obtain the range of the product quantity in the current production stage according to the product quantity of the plastic parts at different moments. Step S33 may be performed to take the maximum value of the range of the number of products in the current production stage as the conventional number of plastic parts, in order to avoid the problem of insufficient serial number coding pool. Finally, step S34 may be performed to collect the conventional number of plastic parts of each type.

Referring to fig. 6, in the above-disclosed directional scheme, in the process of the number range of products in the specific current production stage, step S321 may be executed first to determine whether the production cycle of each type of plastic part can be obtained. If so, step S322 may be performed to take the range between the maximum value and the minimum value of the product quantity at different times in the current production cycle and the previous production cycle as the product quantity range in the current production stage. If not, step S323 may be performed to uniformly divide the history period into a plurality of statistical periods. The duration of the statistical period during practice includes one day, one week, or one month. Step S324 may be performed to obtain the maximum value of the product quantity in each statistical period according to the product quantity of the plastic part at different times, as the product quantity in each statistical period. Finally, step S325 may be executed to obtain the range of the product quantity in the current production stage according to the product quantity in each statistical period.

Referring to fig. 7, in order to obtain the product quantity range in the current production stage, the product quantity range in most cases needs to be mined according to the historical data. In the specific execution process, step S3251 may be first performed to acquire the maximum value of the product number for the entire statistical period. Step S3252 may then be performed to uniformly divide the range within the maximum value of the product quantity for the statistical period into a plurality of numerical range segments. Step S3253 may then be performed to obtain the number of statistical periods encompassed by each numerical range segment as the number of period encompassed by each numerical range segment. Step S3254 may then be performed to obtain a range of product quantities in a most probable state based on the number of time periods encompassed by each range of values. Finally, step S3255 may be executed to take the range of product quantity in the most probable state as the range of product quantity in the current production stage.

To supplement the above-described implementation procedures of steps S3251 to S3255, source codes of part of the functional modules are provided, and a comparison explanation is made in the annotation section. In order to avoid data leakage involving trade secrets, a desensitization process is performed on portions of the data that do not affect implementation of the scheme, as follows.

#include<iostream>

#include<vector>

#include<algorithm>

#include<map>

Obtaining simulation data of the number of products of the plastic parts at different moments

std::vector<int>GetQuantities() {

Where// a fixed analog data set is returned

return {100, 150, 200, 250, 300, 350, 400, 450, 500};

}

Obtaining the range of the number of the finished products in the current production stage according to the number of the finished products in the statistical period

std::pair<int, int>GetProductionRange(const std::vector<int>&quantities, int numRanges) {

Maximum value is/found

int maxQuantity = *std::max_element(quantities.begin(), quantities.end());

Uniformly dividing the maximum range into a plurality of numerical range segments

int rangeSize = maxQuantity / numRanges;

std::vector<int>rangeCounts(numRanges, 0);

Calculating the number of statistical time periods for each numerical range segment

for (int quantity : quantities) {

int rangeIndex = quantity / rangeSize;

Ultrafresh out-of-range index

if (rangeIndex>= numRanges) {

rangeIndex = numRanges - 1;

}

++rangeCounts[rangeIndex];

}

Finding the segment of the numerical range that encompasses the most number of statistical time periods

int maxIndex = std::distance(rangeCounts.begin(), std::max_element(rangeCounts.begin(), rangeCounts.end()));

int lowerBound = maxIndex * rangeSize;

int upperBound = (maxIndex + 1) * rangeSize;

Range of number of products returned to most probable state

return {lowerBound, upperBound};

}

int main() {

std::vector<int>quantities = GetQuantities();

int numranges=5;// dividing the range into 5 numerical range segments

std::pair<int, int>productionRange = GetProductionRange(quantities, numRanges);

Output of the range of product quantity for the current production stage

std is cout < "> the range of the number of finished products produced in the current production stage, [" < < ProductionRange. First < ">" < < ProductionRange. Second < < "> < std:: endl;

return 0;

}

the code firstly obtains the number of products of the plastic parts from the simulation data. The maximum value of the number of finished products for all statistical periods is then determined and this maximum value range is divided uniformly into a specified number of numerical range segments. Then the number of statistical time periods in each numerical range section is calculated, and the numerical range section with the largest number of statistical time periods is found, wherein the range section represents the most probable range of the number of finished products. And finally, outputting the range as the range of the number of finished products in the current production stage. This range may help the production management make more accurate decisions.

Referring to fig. 8, in order to obtain the range of the number of products in the normal state, that is, the range of the number of products in the most probable state, step S3254 may be performed in the specific process by first performing step S32541 to arrange the number of each time period inclusion according to the numerical value to obtain the time period inclusion sequence. Step S32542 may then be performed to obtain a maximum value and a minimum value of the number of segments included in the period of time. Step S32543 may then be performed to take the ratio of the difference between the maximum and minimum values of the segment inclusion numbers in the segment inclusion number series to the total number of all segment inclusion numbers as the element average spacing of the segment inclusion number series. Step S32544 may then be performed to group a plurality of segment inclusion numbers within a segment inclusion number series having a difference between adjacent ones less than an element average spacing into the same segment inclusion number set. Finally, step S32545 may be executed to obtain the numerical range of the numerical range segment corresponding to the number of time periods included in the number set included in each time period as the range of the number of products in the most probable state.

To supplement the above-described implementation procedures of steps S32541 to S32545, source codes of part of the functional modules are provided and a comparison explanation is made in the annotation section.

#include<iostream>

#include<vector>

#include<algorithm>

The/(acquisition period encompasses a number of analog data

std::vector<int>GetSegmentCounts() {

Return a fixed analog data set

return {3, 7, 5, 9, 6, 2, 8, 4, 10};

}

Obtaining the range of the number of the products in the most probable state according to the number of the time period

std::vector<std::pair<int, int>>GetMostProbableRanges(const std::vector<int>&segmentCounts, int rangeSize) {

int totalSegments = segmentCounts.size();

std::vector<int>sortedCounts(segmentCounts);

std.: sort (), sort count end ();// order the number of time slots inclusion

int mincount=sortedcounts. Front ();// minimum period inclusion number

int maxcount=sortedcounts.back ();// maximum period inclusion number

int totalRangeCount =std: (sourceCounts. Begin (), sourceCounts. End (), 0);// total period encompasses number of slots

Calculating average interval

double averageInterval = static_cast<double>(maxCount - minCount) / totalRangeCount;

The number of adjacent time intervals is classified into the same set

std::vector<std::vector<int>>countClusters;

std::vector<int>currentCluster;

for (int count : sortedCounts) {

if (currentCluster.empty() || static_cast<double>(count - currentCluster.back())<averageInterval) {

currentCluster.push_back(count);

} else {

countClusters.push_back(currentCluster);

currentCluster.clear();

currentCluster.push_back(count);

}

if (!currentCluster.empty()) {

countClusters. Push_ back (currentCluster);// Add last set

}

Obtaining corresponding value range segments for each set

std::vector<std::pair<int, int>>mostProbableRanges;

for (const auto&cluster : countClusters) {

int lowerBound = cluster.front() * rangeSize;

int superbound= (cluster. Back () +1) ×rangesize;// includes upper limit

mostProbableRanges.emplace_back(lowerBound, upperBound);

}

return mostProbableRanges;

}

int main() {

std: vector < int > segment counts=getsegment counts ()// acquisition period encompasses number of segments

int rangesize=50;// example each value range segment represents 50 product quantities

std::vector<std::pair<int, int>>mostProbableRanges = GetMostProbableRanges(segmentCounts, rangeSize);

Output of the range of product quantity in the most probable state

std is cout < "> the range of the number of finished products in the most probable state" < < std: endl;

for (const auto&range : mostProbableRanges) {

std::cout<<"["<<range.first<<", "<<range.second<<")"<<std::endl;

}

return 0;

}

the code first simulates acquiring the number of time slots, then ordering the data and calculating the maximum and minimum of the number of time slots. The average interval is then calculated from the ratio of the difference between the maximum and minimum values to the total number. And classifying the number of the adjacent time intervals into a plurality of sets by utilizing the average interval, finally obtaining the numerical range segments corresponding to each set by the code, and outputting the range segments as the number range of the finished products in the most probable state. These ranges may help predict which product quantity range is most likely to occur, thereby optimizing the production plan.

Referring to fig. 9, in order to fully utilize the limited recording code area in the identification bar code to obtain the type code and the serial number code pool allocated to each type of plastic part, step S4 may be executed first in the specific implementation process to obtain the number of code bits required by the serial number code under binary system according to the conventional number of each type of plastic part in step S41. Step S42 can be executed to obtain the maximum available coding bit number of each type of plastic part according to the difference between the available coding bit number of the recording code area and the coding bit number required by the serial number coding of each type of plastic part. Step S43 may be performed to obtain the maximum available value of the category codes of each category of plastic parts in binary according to the maximum available category code number of each category of plastic parts. Step S44 may be performed to assign a category code to each category of plastic parts according to the available maximum value of the category code of each category of plastic parts under the binary system. Finally, step S45 may be executed to form all codes that can be expressed by the coding bit number required for the serial number coding of each kind of plastic parts into serial number coding pools of corresponding kinds of plastic parts.

To supplement the above-described implementation procedures of step S41 to step S45, source codes of part of the functional modules are provided, and a comparison explanation is made in the annotation section.

#include<iostream>

#include<vector>

#include<cmath>

#include<map>

Calculating the number of coding bits required based on conventional numbers

int calculateRequiredBits(int quantity) {

return std::ceil(std::log2(quantity));

}

Class/sequence number coding pool

void allocateCategoryAndSerialCode(std::map<int, int>&categoryQuantityMap, int availableBits) {

std: map < int > category ToCocodebits;// store the number of category encoding bits corresponding to each category

std: map < int, int > category ToMaxCode;// store maximum value of category codes for each category

std: map < int, std: vector < int > > servalcodePools;// storage sequence number coding pool

Every plastic part type is/is traversed

for (const auto&pair : categoryQuantityMap) {

int category = pair.first;

int quantity = pair.second;

Number of bits required for encoding of/calculation sequence number

int serialBits = calculateRequiredBits(quantity);

Calculating the maximum available class encoding bits

int categoryBits = availableBits - serialBits;

categoryToCodeBits[category] = categoryBits;

Maximum value of class code for/(computation)

int maxCategoryCode = (1<<categoryBits) - 1;

categoryToMaxCode[category] = maxCategoryCode;

Coding pool of/generation sequence number

int maxSerialCode = (1<<serialBits) - 1;

std::vector<int>serialPool;

for (int i = 0; i<= maxSerialCode; ++i) {

serialPool.push_back(i);

}

serialCodePools[category] = serialPool;

}

Output result

std: cout < < "kind code and sequence number code assignment result: "< < std:: endl;

for (const auto&pair : categoryToMaxCode) {

int category = pair.first;

int maxCode = pair.second;

the maximum category code of cout < < < category < "> is" < < maxCode < ">, and the coding bit number is" < < category ] < < std: ";

the size of a sequence number coding pool of cout < < < category > < < sequence number coding pool is "< < servialcodes [ category ]. Size () < < std:: endl;

}

int main() {

the number of available coding bits for the/(m) example is 12

int availableBits = 12;

Class of plastic parts/example and conventional quantity thereof

std::map<int, int>categoryQuantityMap = {

{1, 1000},// conventional number of species 1

{2, 2000},// conventional number of species 2

It is possible to continue to add more classes and numbers

};

Class/sequence number coding pool

allocateCategoryAndSerialCode(categoryQuantityMap, availableBits);

return 0;

}

This code first defines a function calcluateRequiredbits to calculate the number of binary digits required to represent a given number of sequence numbers. Then defining an allocatepegolysaurialcode function to receive the conventional number of plastic parts of each category and the available coding bit number of the record code area, calculating the maximum available category coding bit number of the plastic parts of each category, then calculating the available maximum value of category codes of each category and assigning the category codes to each category. Finally, the function will also generate a sequence number code pool for each type of plastic part, which pool contains all possible sequence number codes. The main function main provides the mapping of the available coding bit number, the plastic part type and the conventional number, and then invokes the allocatecategorical and serial code function to carry out the type coding and the distribution of the serial number coding pool and output the result.

Referring to fig. 10, for the recovered serial number codes, the recycling interval duration of the codes may be delayed as much as possible in order to avoid accidents, although the recycling of injection molding parts in the injection molding workshop and warehouse circulation inventory will not be repeated. When the plastic parts are produced according to the production sequence, for each type of plastic parts, step S51 may be executed first in the implementation process to obtain the last recovered time of each serial number code in the current serial number code pool. Step S52 may be performed to assign the serial number code with the longest last recycling time to the produced plastic part. Finally, step S53 may be executed to obtain serial number codes of each plastic part by continuous allocation. The recycling interval duration of the sequence number codes is prolonged in the process.

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved.

It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by hardware, such as circuits or ASICs (application specific integrated circuits, application Specific Integrated Circuit), which perform the corresponding functions or acts, or combinations of hardware and software, such as firmware, etc.

Although the invention is described herein in connection with various embodiments, other variations to the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed invention, from a study of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the "a" or "an" does not exclude a plurality. A single processor or other unit may fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.

The embodiments of the present application have been described above, the foregoing description is exemplary, not exhaustive, and not limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope of the various embodiments described. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or the improvement of technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Claims

1. A bar code management method for circulation of an injection molding workshop and a warehouse is characterized by comprising the following steps of,

acquiring available coding digits of the recording code area;

2. The method of claim 1, wherein the step of obtaining the conventional number of plastic parts of each type based on the number of plastic parts of each type in the shop and warehouse acquired in real time comprises,

for each type of plastic part,

obtaining the number of finished products of the plastic parts at different moments according to the number of the plastic parts in a workshop and a warehouse which are obtained in real time,

obtaining the range of the number of the finished products in the current production stage according to the number of the finished products of the plastic parts at different moments,

taking the maximum value of the number range of finished products produced in the current production stage as the conventional number of plastic parts;

the conventional number of plastic parts of each type is summarized.

3. The method of claim 2, wherein the step of obtaining the range of the number of products in the current production stage based on the number of products of the plastic parts at different times comprises,

judging whether the production period of each kind of plastic parts can be obtained or not;

if so, taking the range between the maximum value and the minimum value of the product quantity at different moments in the current production period and the last production period as the product quantity range in the current production stage;

if not, uniformly dividing the historical time period into a plurality of statistical time periods, wherein the duration of the statistical time periods comprises one day, one week or one month;

obtaining the maximum value of the product quantity in each counting period according to the product quantity of the plastic parts at different moments as the product quantity in each counting period;

and obtaining the range of the number of the finished products in the current production stage according to the number of the finished products in each statistical period.

4. The method of claim 3, wherein the step of obtaining a range of product quantities at the current production stage based on the product quantities for each of the statistical time periods comprises,

obtaining the maximum value of the number of finished products in all the statistical time periods;

uniformly dividing a range within the maximum value of the number of finished products in the statistical period into a plurality of numerical range sections;

acquiring the number of the statistical time periods included in each numerical range section as the time period included number of each numerical range section;

obtaining the number range of the finished product in the most probable state according to the time period inclusion number of each numerical range section;

and taking the range of the number of the finished products in the most probable state as the range of the number of the finished products in the current production stage.

5. The method of claim 4, wherein the step of obtaining the range of product quantities in the most probable state from the number of time intervals encompassed by each range of values comprises,

arranging the number of the time period inclusion according to the numerical value to obtain a time period inclusion sequence;

obtaining a maximum value and a minimum value of the number of segment inclusion in the period inclusion sequence;

taking the ratio of the difference value between the maximum value and the minimum value of the segment inclusion numbers in the segment inclusion number sequence and the total number of all the segment inclusion numbers as the element average interval of the segment inclusion number sequence;

dividing a plurality of segment inclusion numbers of which the difference value between adjacent segments in the segment inclusion number sequence is smaller than the element average interval into the same segment inclusion number set;

and acquiring the numerical value range of the numerical value range section corresponding to the number included in the time period included number in each time period included number set as the number range of the finished product in the most probable state.

6. The method of claim 1, wherein the step of assigning each type of plastic part a type code and serial number code pool according to the conventional number of each type of plastic part comprises,

obtaining the number of coding bits required by the binary sequence number coding according to the conventional number of each kind of plastic parts;

obtaining the maximum available type coding digit of each type of plastic part according to the difference value between the available coding digit of the recording code area and the coding digit required by the serial number coding of each type of plastic part;

obtaining the available maximum value of the type codes of each type of plastic parts under the binary system according to the maximum available type coding bit number of each type of plastic parts;

assigning a variety code to each variety of plastic parts according to the available maximum value of the variety code of each variety of plastic parts under the binary system;

all codes which can be expressed by coding bits required by the serial number coding of each kind of plastic parts form a serial number coding pool of the corresponding kind of plastic parts.

7. The method of claim 1, wherein the step of assigning a serial number code to each plastic part according to the production sequence of the plastic parts based on the corresponding serial number code pool comprises,

when the plastic parts are produced according to the production sequence, for each type of plastic parts,

acquiring the last recovered time of each sequence number code in the current sequence number code pool,

the serial number code with the longest recycling time is allocated to the production of the plastic parts,

and continuously distributing to obtain the serial number code of each plastic part.

8. A bar code management system for circulation of an injection molding workshop and a warehouse is characterized by comprising,

acquiring available coding digits of the recording code area;

arranging the identification bar code on the corresponding plastic part;