Docking station feeding scheduling method and device and storage medium

Abstract

The application discloses a kind of docking station material loading scheduling method, device and storage medium, it is related to intelligent scheduling technical field, the method comprises: when target docking station needs to load, reference information is obtained, the reference information includes: the distance information between each material buffer bit and the target docking station, the storage remaining time of material in each material buffer bit and the remaining loading time of the next loading of the docking station to which each material buffer bit belongs;Obtain the weight factor of various reference information;According to the reference information and the weight factor of various reference information, the cost value of each material buffer bit is calculated;According to the cost value of each material buffer bit calculated, material is scheduled to the target docking station.The problem that the production efficiency is low due to the unreasonable scheduling rule in the prior art is solved, the time factor and the distance factor are considered simultaneously, the rationality of the scheduling rule is improved, and the production efficiency is improved.

Description

Technical Field

[0001] This invention relates to a feeding and scheduling method, device, and storage medium for a connecting platform, belonging to the field of intelligent scheduling technology. Background Technology

[0002] Today, solar energy has become one of the representatives of clean energy. The change in energy structure requires solar cell factories to be able to meet the massive demand for clean energy now and for a long time to come.

[0003] However, existing cell manufacturing workshops have some shortcomings in the production process. In particular, when the feeder receives materials from the buffer position, it often picks up materials according to the minimum spatial distance. This method is the optimal strategy for the current feeder, but it is not the optimal strategy for the overall production. It will increase the transfer path length of the material cart and reduce production efficiency. Summary of the Invention

[0004] The purpose of this invention is to provide a feeding and scheduling method, apparatus and storage medium for connecting platforms, in order to solve the problems existing in the prior art.

[0005] To achieve the above objectives, the present invention provides the following technical solution:

[0006] According to a first aspect, embodiments of the present invention provide a method for scheduling loading onto a connecting platform, the method comprising:

[0007] When the target docking station needs to be loaded, reference information is obtained, including: distance information between each material buffer position and the target docking station, remaining storage time of materials in each material buffer position, and remaining loading time of the docking station to which each material buffer position belongs for the next loading.

[0008] Weighting factors for obtaining various reference information;

[0009] The cost of each data cache bit is calculated based on the reference information and the weighting factors of various reference information.

[0010] Materials are dispatched to the target docking station based on the calculated cost of each material buffer position.

[0011] Optionally, obtaining reference information includes:

[0012] Obtain the original reference information;

[0013] The original reference information is standardized, and the standardized information is used as the reference information.

[0014] Optionally, the standardization of the original reference information, using the standardized information as the reference information, includes:

[0015] For each type of original reference information, obtain the maximum and minimum values ​​of the original reference information;

[0016] The standardized information for each original reference information is calculated based on the maximum and minimum values.

[0017] Optionally, the step of calculating the standardized information for each piece of original reference information based on the maximum and minimum values ​​includes:

[0018] If the obtained original reference information is actual, the maximum value is max, and the minimum value is min, then the standardized information is:

[0019] Optionally, the weighting factors for obtaining various reference information include:

[0020] For each data cache bit, a weighting factor for each type of reference information is calculated for that data cache bit based on the reference information of that data cache bit.

[0021] Optionally, for each loaded buffer bit, calculating the weighting factor of each reference information in the loaded buffer bit based on the reference information of the loaded buffer bit includes:

[0022]

[0023]

[0024]

[0025] Among them, t Si plat_t represents the remaining storage time of the material in the i-th material buffer slot. Si d represents the remaining time for the next loading of the feeder station to which the i-th material buffer slot belongs. i Let α be the distance between the i-th material-containing buffer position and its corresponding docking station, α be the weight of the remaining storage time of the material in the i-th buffer position, β be the weight of the remaining loading time of the next loading of the docking station to which the i-th material-containing buffer position belongs, γ be the weight of the distance between the i-th material-containing buffer position and the target docking station, 0 < i ≤ l, and l be the total number of material-containing buffer positions.

[0026] Optionally, calculating the cost of each data-rich cache bit based on the reference information and the weighting factors of various reference information includes:

[0027] cost i =α i *t Si +β i *plat_t Si *+γi *d Si

[0028] Among them, cost i Let i be the cost of the i-th data cache bit.

[0029] Optionally, the step of scheduling materials to the target receiving station based on the calculated cost of each material buffer location includes:

[0030] The material in the lowest-value material buffer slot is transferred to the target docking station.

[0031] In a second aspect, a feeder scheduling device for a connecting platform is provided. The device includes a memory and a processor. The memory stores at least one program instruction, and the processor loads and executes the at least one program instruction to implement the method described in the first aspect.

[0032] Thirdly, a computer storage medium is provided, wherein at least one program instruction is stored therein, the at least one program instruction being loaded and executed by a processor to implement the method described in the first aspect.

[0033] When a target feeder station needs to be loaded, reference information is obtained. This reference information includes: the distance between each material buffer position and the target feeder station, the remaining storage time of the material in each material buffer position, and the remaining loading time of the feeder station to which each material buffer position belongs for the next loading. Weighting factors for each type of reference information are obtained. Based on the reference information and its weighting factors, the cost value of each material buffer position is calculated. Materials are then dispatched to the target feeder station based on the calculated cost value of each material buffer position. This solves the problem of low production efficiency caused by unreasonable scheduling rules in existing solutions, achieving the effect of simultaneously considering time and distance factors, improving the rationality of scheduling rules, and thus improving production efficiency.

[0034] This application considers the remaining storage time during the scheduling process, thereby avoiding secondary transfers and connections due to exceeding the remaining storage time, greatly reducing time waste. Furthermore, this method takes into account the loading status of the connection station to which the buffer slot belongs. If the connection station to which the buffer slot belongs has loading needs in the short term, the priority of that buffer slot will be greatly reduced. In addition, the method used in this application has a fast solution speed and will not affect on-site production.

[0035] The above description is merely an overview of the technical solution of the present invention. In order to better understand the technical means of the present invention and to implement it in accordance with the contents of the specification, the preferred embodiments of the present invention are described in detail below with reference to the accompanying drawings. Attached Figure Description

[0036] Figure 1 This is a schematic diagram illustrating one possible implementation scenario of an embodiment of the present invention;

[0037] Figure 2 This is a flowchart of a feeding and scheduling method for a connecting platform provided in an embodiment of the present invention. Detailed Implementation

[0038] The technical solution of the present invention will now be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0039] In the description of this invention, it should be noted that the terms "center," "upper," "lower," "left," "right," "vertical," "horizontal," "inner," and "outer," etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. They are used only for the convenience of describing the invention and for simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, they should not be construed as limitations on the invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and should not be construed as indicating or implying relative importance.

[0040] In the description of this invention, it should be noted that, unless otherwise explicitly specified and limited, the terms "installation," "connection," and "linking" should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral connection; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium; and they can refer to the internal connection of two components. Those skilled in the art can understand the specific meaning of the above terms in this invention based on the specific circumstances.

[0041] Furthermore, the technical features involved in the different embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0042] First, for ease of understanding, a brief introduction to the implementation environment involved in this application will be given, such as... Figure 1The diagram illustrates two consecutive production processes. Process X has *m* machines, and process (X+1) has *n* machines. Each machine in process (X+1) is configured with a buffer slot to store materials not yet used in process X. In actual production, if no machine in process (X+1) needs to be loaded, the completed materials from process X will be temporarily stored in the buffer slot of process (X+1). However, to ensure material quality, the materials have a storage time T in the buffer slot. If the storage time T is exceeded, the materials in the buffer slot will be transported to a buffer warehouse to extend the material's storage time. When a machine in process (X+1) needs to be loaded, it will retrieve materials from the buffer slot for production.

[0043] Please refer to Figure 2 It illustrates a flowchart of a method for scheduling feeder loading on a docking platform according to an embodiment of this application, as shown below. Figure 2 As shown, the method includes:

[0044] Step 201: Obtain reference information when the target docking station needs to be loaded with materials;

[0045] The reference information includes: the distance between each material buffer position and the target docking station, the remaining storage time of the material in each material buffer position, and the remaining time for the next material loading of the docking station to which each material buffer position belongs.

[0046] The steps for obtaining distance information include: obtaining the coordinates of all connecting stations in process (X+1) and the coordinates of the buffer positions of each connecting station; and calculating the distance from the current target connecting station (x1, y1) to each buffer position with material (X) based on the coordinates. i ,Y j The spatial distance. In practice, the Manhattan distance can be used for calculation, and the formula is:

[0047] d=(x1-X i )+(y1-Y j )

[0048] We obtain the spatial distance set D = {d1, d2, d3, ..., d...} l}, where l is the number of cache bits containing data.

[0049] The steps to obtain the remaining storage time of materials in each material buffer slot include: obtaining the maximum storage time T of the materials in the material buffer slot, and obtaining the storage time t of the materials. r Then the remaining storage time can be obtained as (Tt) r If the remaining storage time is denoted as t, then the set of remaining storage times for all data-containing buffer slots is obtained as t = {t1, t2, t3, ..., t4}. l}, where l is the number of cache bits containing data. Where t rThis is the time elapsed after the material is stored in the buffer location, measured by a timer.

[0050] The steps for obtaining the remaining loading time for the next loading of each material buffer position's connecting station include: obtaining the loading time of the last loading on each connecting station, obtaining the interval between two adjacent loadings on the connecting station, and calculating the remaining loading time for the next loading based on the interval and the loading time of the last loading. The interval is the processing time for that operation. In one possible embodiment, the set of remaining loading times is plat_t = {plat_t1, plat_t2, plat_t3, ..., plat_t...} l}, where l is the number of cache bits containing data.

[0051] In one possible implementation, since distance information is spatial data and time information is temporal data, and the two have different dimensions, they need to be standardized to remove the influence of dimensions. That is, this step may include:

[0052] First, obtain the original reference information;

[0053] Second, the original reference information is standardized, and the standardized information is used as the reference information.

[0054] (1) For each type of original reference information, obtain the maximum and minimum values ​​of the original reference information;

[0055] (2) Calculate the standardized information of each original reference information based on the maximum value and the minimum value.

[0056] In actual implementation, if the obtained original reference information is 'actual', the maximum value is 'max', and the minimum value is 'min', then the standardized information is:

[0057] Specifically:

[0058] A. Standardization of the spatial distance set D. First, the maximum and minimum spatial distances from all docking stations to all buffer positions need to be calculated; then, all elements in set D are sequentially selected and processed according to the formula above. The standardized spatial distances are obtained by performing standardization sequentially, denoted as D. S ={d S1 ,d S2 ,d S3 ,…,d Sl};

[0059] B. Standardize the set t of remaining storage time for all material in the buffer slots of process (X+1). The maximum value is the maximum storage time T of the material in the current process's buffer, and the minimum value is 0. Then, according to the formula... The standardized set is t. S ={t S1 ,t S2 ,t S3 ,…,t Sl}

[0060] C. Standardization of the set of remaining loading times plat_t before the next loading at the docking station. The maximum value is the processing time of the docking station, denoted as T. E The minimum value is 0, so according to the formula The standardized set is as follows:

[0061] plat_t S ={plat_t S1 plat_t S2 plat_t S3 , ..., plat_t Sl}

[0062] After the above steps, we obtain three standardized values ​​for each data cache bit, that is, each cache bit corresponds to three standardized values.

[0063] Step 202: Obtain the weighting factors for various reference information;

[0064] For each data cache bit, a weighting factor for each type of reference information is calculated for that data cache bit based on the reference information of that data cache bit.

[0065]

[0066]

[0067]

[0068] Among them, t Si plat_t represents the remaining storage time of the material in the i-th material buffer slot. Si d represents the remaining time for the next loading of the feeder station to which the i-th material buffer slot belongs. i Let α be the distance between the i-th material-containing buffer position and its corresponding docking station, α be the weight of the remaining storage time of the material in the i-th buffer position, β be the weight of the remaining loading time of the next loading of the docking station to which the i-th material-containing buffer position belongs, γ be the weight of the distance between the i-th material-containing buffer position and the target docking station, 0 < i ≤ l, and l be the total number of material-containing buffer positions.

[0069] Based on the above implementation, the weight factor corresponding to each data-rich cache bit can be calculated as follows:

[0070] α is the weighted set of the remaining storage time of materials in the material buffer slot, α = {α1, α2, α3, ..., α...} l};

[0071] β is the weighted set of the remaining loading time for the feeder station to which the material buffer position belongs, β = {β1, β2, β3, ..., β} l}; γ is the weighted set of distances between the material buffer location and the target docking station, γ = {γ1, γ2, γ3, ..., γ}. l};

[0072] Step 203: Calculate the cost of each data cache bit based on the reference information and the weighting factors of various reference information;

[0073] In this application, the cost refers to the price incurred when scheduling the material buffer bit. That is, the higher the cost, the higher the price and the greater the impact on subsequent production efficiency; the lower the cost, the lower the price and the less the impact on subsequent production efficiency.

[0074] cost i =α i *t Si +β i *plat_t Si *+γ i *d Si

[0075] Among them, cost i Let i be the cost of the i-th data cache bit.

[0076] Based on this formula, the set of costs for the available cache bits is denoted as:

[0077] cost={cost1,cost2,cost3,…,cost l}

[0078] Each value corresponds to the cost of a connecting station.

[0079] Step 204: Dispatch materials to the target docking station according to the calculated cost of each material buffer position.

[0080] The material in the lowest-value material buffer location is transferred to the target transfer station. In this process, the coordinates of the lowest-value material buffer location are sent to the AGV (Automated Guided Vehicle), which then transfers the material from that buffer location to the target transfer station.

[0081] In summary, by acquiring reference information when the target feeder station needs to be loaded, including: the distance between each material buffer position and the target feeder station, the remaining storage time of the material in each material buffer position, and the remaining loading time of the feeder station to which each material buffer position belongs for the next loading; obtaining weighting factors for various reference information; calculating the cost value of each material buffer position based on the reference information and the weighting factors; and scheduling materials to the target feeder station based on the calculated cost value of each material buffer position, this method solves the problem of low production efficiency caused by unreasonable scheduling rules in existing solutions. It achieves the effect of simultaneously considering time and distance factors, improving the rationality of scheduling rules, and thus improving production efficiency.

[0082] This application considers the remaining storage time during the scheduling process, thereby avoiding secondary transfers and connections due to exceeding the remaining storage time, greatly reducing time waste. Furthermore, this method takes into account the loading status of the connection station to which the buffer slot belongs. If the connection station to which the buffer slot belongs has loading needs in the short term, the priority of that buffer slot will be greatly reduced. In addition, the method used in this application has a fast solution speed and will not affect on-site production.

[0083] This application also provides a feeder scheduling device for a connecting platform, the device including a memory and a processor, the memory storing at least one program instruction, and the processor loading and executing the at least one program instruction to implement the method described above.

[0084] This application also provides a computer storage medium storing at least one program instruction, which is loaded and executed by a processor to implement the method described above.

[0085] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0086] The embodiments described above are merely illustrative of several implementations of the present invention, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the invention patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of the present invention, and these all fall within the protection scope of the present invention. Therefore, the protection scope of this invention patent should be determined by the appended claims.

Claims

1. A method for scheduling loading on a docking station, characterized in that, The method comprises: When the target docking station needs to be loaded, reference information is obtained, the reference information including distance information between each loaded buffer position and the target docking station, storage remaining time of materials in each loaded buffer position, and loading remaining time of the docking station to which each loaded buffer position belongs next time; The weight factor of each reference information is obtained, including: For each loaded buffer position, the weight factor of each reference information in the loaded buffer position is calculated according to the reference information of the loaded buffer position, including: wherein t Si is the remaining storage time of the material in the i-th material buffer position, plat_t Si is the remaining loading time of the next loading of the i-th material buffer position belonging to the docking platform, d i is the distance between the i-th material buffer position and the docking platform to which it belongs, a is the weight of the remaining storage time of the material in the i-th buffer position, β is the weight of the remaining loading time of the next loading of the i-th material buffer position belonging to the docking platform, γ is the weight of the distance between the i-th material buffer position and the target docking platform, 0 < i ≤ l, and l is the total number of material buffer positions. The cost value of each loaded buffer position is calculated according to the reference information and the weight factor of each reference information; The materials are dispatched to the target docking station according to the calculated cost value of each loaded buffer position.

2. The method of claim 1, wherein, The reference information is obtained, including: The original reference information is obtained; The original reference information is standardized, and the standardized information is taken as the reference information.

3. The method of claim 2, wherein, The original reference information is standardized, and the standardized information is taken as the reference information, including: For each original reference information, the maximum value and the minimum value of the original reference information are obtained; The standardized information of each original reference information is calculated according to the maximum value and the minimum value.

4. The method of claim 3, wherein, The standardized information of each original reference information is calculated according to the maximum value and the minimum value, including: If the obtained original reference information is actual, the maximum value is max, and the minimum value is min, the standardized information is:

5. The method of claim 1, wherein, The cost value of each loaded buffer position is calculated according to the reference information and the weight factor of each reference information, including: cost i = alpha i * t Si + beta i * plat_t Si + gamma i * d Si where cost i is the cost of the ith cache line with data.

6. The method according to any one of claims 1 to 5, characterized in that, The materials are dispatched to the target docking station according to the calculated cost value of each loaded buffer position, including: The materials in the loaded buffer position with the minimum cost value are transferred to the target docking station.

7. A docking station loading scheduling apparatus, characterized by, The device comprises a memory and a processor, and at least one program instruction is stored in the memory, and the processor loads and executes the at least one program instruction to realize the method according to any one of claims 1 to 6.

8. A computer storage medium, characterized in that The computer storage medium stores at least one program instruction, and the at least one program instruction is loaded and executed by the processor to realize the method according to any one of claims 1 to 6.

Images