Product spraying production scheduling method and device and electronic equipment

Abstract

The invention provides a product spraying production scheduling method and device and electronic device.The product spraying production scheduling method comprises the steps that skid data on a production line and to-be-sprayed product data are obtained, and the product data comprise the types of products and to-be-sprayed color information of each type of products; based on the skid data and the product data, a color block arrangement model is constructed, and the color block arrangement model comprises a color block arrangement function and a color block arrangement constraint condition; solving the color block arrangement model to obtain color block arrangement data of the production line in each production cycle; based on the color block arrangement data and the skid data, a product arrangement model is constructed, and the product arrangement model comprises a product arrangement function and a product arrangement constraint condition; and solving the product arrangement model to obtain corresponding product data of each skid in each production cycle on the production line. According to the method, various production factors and constraint conditions can be fully considered, and the production plan is efficiently performed.

Description

Technical Field

[0001] The present invention relates to the technical field of production planning and scheduling, and particularly relates to a method for scheduling product spraying production, a device for scheduling product spraying production, and an electronic device. Background Art

[0002] In the spraying production process, especially in the spraying production of molded products, the spraying production plan mainly relies on manual scheduling, that is, relying on the experience and judgment of staff to arrange the spraying order of different batches of products. However, in the process of formulating the spraying production plan, various complex business logics and restrictive conditions need to be considered. For example, product batches with large color differences cannot be sprayed continuously, and there are arrangement taboos between certain specific types of products, resulting in more complex production plan formulation. Manual scheduling is not only inefficient, difficult to quickly respond to market changes, but also prone to errors, affecting production efficiency and product quality. Summary of the Invention

[0003] The present invention is made based on the inventor's discovery and recognition of the following facts and problems:

[0004] The spraying process of molding is completed on a conveyor track. There are skids installed on the conveyor track, and multiple brackets are installed on the skids. Each part needs to be placed on a specific bracket for sequential spraying. A production cycle of the spraying process is called a "round" or "Loop". There are several skids in a round, and there is a one-to-one correspondence between the bracket type and the part type. This means that the type and quantity of parts on each skid are fixed, and the production plan needs to reasonably arrange the spraying order of the parts on each skid to ensure efficient production.

[0005] However, with the increasing diversification of market demands and the continuous expansion of production scale, various complex business logics and restrictive conditions need to be comprehensively considered in the process of formulating the spraying production plan. For example, since the color difference between different colors will affect the spraying effect and product quality, product batches with large color differences cannot be sprayed continuously, and there are even arrangement taboos between certain specific types of products.

[0006] These business logics and restrictive conditions make the formulation of the production plan more complex and difficult. On the one hand, manual scheduling is inefficient, and staff need to spend a lot of time and energy analyzing and judging various possible arrangement schemes, and it is difficult to quickly respond to market changes. On the other hand, manual scheduling is prone to errors. Due to the influence of human subjective factors and fatigue and other factors, staff may make omissions or mistakes when formulating the production plan, thus affecting production efficiency and product quality.

[0007] To this end, the present invention provides a product spraying production scheduling method, a product spraying production scheduling device, and an electronic device, which can avoid subjectivity and arbitrariness in manual scheduling, fully consider various production factors and constraints, efficiently formulate production plans, thereby improving the efficiency and quality of spraying production and reducing production costs.

[0008] The product spraying production scheduling method provided by the embodiments of the present invention includes the following steps:

[0009] Obtain the skid data on the production line and the product data to be sprayed, where the product data includes the type of the product and the color information to be sprayed for each type of product;

[0010] Based on the skid data and the product data, construct a color block layout model, where the color block layout model includes a color block layout function and color block layout constraint conditions;

[0011] Solve the color block layout model to obtain the color block layout data of the production line in each production cycle;

[0012] Based on the color block layout data and the skid data, construct a product layout model, where the product layout model includes a product layout function and product layout constraint conditions;

[0013] Solve the product layout model to obtain the product data corresponding to each skid on the production line in each production cycle.

[0014] In summary, the product spraying production scheduling method provided by the present invention uses a two-stage discrete modeling method to divide the scheduling process into two stages. In the first stage, that is, the color block layout process, by constructing a color block layout model, a complex spraying production scheduling problem is simplified into a color block layout problem, and color block layout constraint conditions such as color connection relationships are comprehensively considered to calculate the color block layout and the specific number of production parts within the color block in each production cycle. In the second stage, that is, the product layout process, through the product layout model, combined with the color block layout data and the skid data, determine the specific layout plan for each skid. This product spraying production scheduling method is more scientific, accurate, and efficient than manual scheduling, can avoid subjectivity and arbitrariness in manual scheduling, fully consider various production factors and constraints, and formulate the optimal production plan, thereby improving the efficiency and quality of spraying production and reducing production costs.

[0015] In some embodiments, the step of constructing a color block layout model based on the skid data and the product data includes:

[0016] Based on the skid data and the product data, calculate the quantity of color types, the total number of product switches between adjacent production cycles, the total number of spray color switches between adjacent production cycles, and the total number of skids with unmet production demands;

[0017] Based on the quantity of color types, the total number of product switches between adjacent production cycles, the total number of spray color switches between adjacent production cycles, and the total number of skids with unmet production demands, construct a color block layout function with the goal of minimizing the weighted sum.

[0018] In some embodiments, the step of calculating the quantity of color types, the total number of product switches between adjacent production cycles, the total number of spray color switches between adjacent production cycles, and the total number of skids with unmet production demands based on the skid data and the product data includes:

[0019] Based on the skid data and the product data, obtain the quantity and color of color blocks sprayed on the production line in each production cycle;

[0020] If the color sprayed on the s-th color block in the l-th production cycle is the same as the color sprayed on the s-th color block in the (l - 1)-th production cycle, obtain the Boolean value y of the change in spray color between adjacent production cycles s,l = 0; otherwise, the Boolean value y of the change in spray color between adjacent production cycles s,l = 1;

[0021] Accumulate all the Boolean values of the change in spray color between adjacent production cycles to obtain the total number of spray color switches between adjacent production cycles.

[0022] In some embodiments, the step of calculating the quantity of color types, the total number of product switches between adjacent production cycles, the total number of spray color switches between adjacent production cycles, and the total number of skids with unmet production demands based on the skid data and the product data includes:

[0023] Based on the skid data and the product data, obtain the product types sprayed in each production cycle and the corresponding quantities;

[0024] If the quantity of r products of color c sprayed in the (l - 1)-th production cycle is the same as the quantity of r products of color c produced in the l-th production cycle, obtain the Boolean value pd of the change in product quantity between adjacent production cycles c,r,l = 0; otherwise, obtain the Boolean value pd of the change in product quantity between adjacent production cycles c,r,l = 1;

[0025] Accumulate all the Boolean values of the change in product quantity between adjacent production cycles to obtain the total number of product switches between adjacent production cycles.

[0026] In some embodiments, the color block arrangement constraint conditions include at least one of a color uniqueness constraint condition, a continuity constraint condition, a color change limit constraint condition, a support upper limit constraint condition, a color order constraint condition, and a requirement satisfaction constraint condition.

[0027] In some embodiments, the step of constructing a product arrangement model based on the color block arrangement data and the skid data includes:

[0028] Based on the color block arrangement data and the skid data, obtain the product type on each skid in each production cycle;

[0029] Based on the product type on each skid in each production cycle, record the number of times the product type on the skid changes in adjacent production cycles;

[0030] Take the sum of minimizing the number of times the product type on the skid changes in adjacent production cycles as the optimization objective, and construct a product arrangement function.

[0031] In some embodiments, the step of recording the number of times the product type on the skid changes in adjacent production cycles based on the product type on each skid in each production cycle includes:

[0032] Based on the product type on each skid in each production cycle, obtain the product type on the nth skid in the lth production cycle and the product type on the nth skid in the (l - 1)th production cycle;

[0033] If the product type on the nth skid in the lth production cycle is the same as the product type on the nth skid in the (l - 1)th production cycle, obtain the Boolean value zd of the product switch on the skid in adjacent production cycles n,l = 0; otherwise, the Boolean value zd of the product switch on the skid in adjacent production cycles n,l = 1;

[0034] Accumulate all the Boolean values of the product switch on the skid in adjacent production cycles to obtain the number of times the product type on the skid changes in adjacent production cycles.

[0035] In some embodiments, the product arrangement constraint conditions include at least one of a product uniqueness constraint condition, a product certainty constraint condition within a color block, and a product order constraint condition.

[0036] In addition, the product spraying production scheduling device provided by the present invention includes:

[0037] An acquisition module, the acquisition module is used to acquire skid data on the production line and product data to be sprayed, and the product data includes product type and color information to be sprayed for each type of product;

[0038] Color block arrangement model construction module, which is used to construct a color block arrangement model according to the skid data and the product data, and the color block arrangement model includes a color block arrangement function and color block arrangement constraint conditions;

[0039] Color block arrangement solving module, which is used to solve the color block arrangement model to obtain the color block arrangement data of the production line in each production cycle;

[0040] Product arrangement model construction module, which is used to construct a product arrangement model according to the color block arrangement data and the skid data, and the product arrangement model includes a product arrangement function and product arrangement constraint conditions;

[0041] Product arrangement model solving module, which is used to solve the product arrangement model to obtain the product data corresponding to each skid on the production line in each production cycle.

[0042] In addition, the electronic device provided by the embodiment of the present invention includes a processor and a memory. The memory stores machine-readable instructions executable by the processor. When the machine-readable instructions are executed by the processor, the steps in the product spraying production scheduling method provided in any of the above embodiments are executed. Description of the Drawings

[0043] The drawings are used to provide a further understanding of the embodiments of the present invention, and constitute a part of the specification. Together with the following specific embodiments, they are used to explain the embodiments of the present invention, but do not constitute a limitation to the embodiments of the present invention. In the drawings:

[0044] Figure 1 It is a flowchart of the product spraying production scheduling method provided by an embodiment of the present invention.

[0045] Figure 2 It is a structural schematic diagram of the product spraying production scheduling device provided by an embodiment of the present invention.

[0046] Figure 3 It is a hardware structural schematic diagram of the electronic device provided by an embodiment of the present invention.

[0047] Reference numerals:

[0048] 100, product spraying production scheduling device; 110, acquisition module; 120, color block arrangement model construction module; 130, color block arrangement solving module; 140, product arrangement model construction module; 150, product arrangement model solving module;

[0049] 210, processor; 220, memory; 230, communication interface; 240, communication bus. Specific Embodiments

[0050] The embodiments of the present invention will be described in detail below. Examples of the embodiments are shown in the accompanying drawings. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to explain the present invention, and should not be construed as limiting the present invention.

[0051] Reference Figure 1 , which is a schematic flowchart of a product spraying production scheduling method provided by an embodiment of the present invention. To facilitate the description of the execution process of the steps in the product spraying production scheduling method, the following explanations are given for the set symbols in the execution process of the steps:

[0052]

[0053]

[0054] In the present application, the product spraying production scheduling method includes the following steps:

[0055] S10. Obtain the skid data on the production line and the product data to be sprayed. The product data includes the type of the product and the color information to be sprayed for each type of product.

[0056] Among them, the skid data on the production line may include information such as the number, number, and position of the skids. The color information may include information such as the type and color number of the color.

[0057] It should be noted that the spraying process of the product is usually completed on the conveyor track. Most of these conveyor tracks show a circular conveyor layout, and a plurality of skids are continuously arranged on the conveyor track. These skids can carry the products to be sprayed and move them to the spraying equipment to complete the spraying operation. Each skid rotates one week on the conveyor track, that is, completes one cycle (Loop) of travel, which is called a production cycle. During this production cycle, the skid will pass through each station of the spraying equipment to complete the spraying operation of the product. The skid can be provided with a plurality of brackets according to actual needs, and the type of the bracket corresponds to the type of the product one by one.

[0058] S20. Based on the skid data and the product data, construct a color block layout model, which includes a color block layout function and color block layout constraint conditions.

[0059] Among them, the skids of the same color within one production cycle are set as one color block. For example, if there are a plurality of consecutive skids that need to be sprayed with the same color in a certain production cycle, these skids are integrated and regarded as one color block, so as to simplify the scheduling problem involving multiple skids and multiple colors into the layout problem of color blocks, reduce the complexity of the problem, and facilitate analysis.

[0060] The color block arrangement function calculates the optimal arrangement of color blocks within a production cycle based on the color information of the product and the distribution of skids, taking into account various factors such as the number of color types and the total number of product switches between adjacent production cycles. The color block arrangement constraint conditions are a series of restrictive rules set for the color block arrangement to ensure that the arrangement plan of color blocks meets the various requirements and specifications of actual production. These color block arrangement constraint conditions can cooperate with the color block arrangement function to jointly optimize the arrangement plan of color blocks.

[0061] S30. Solve the color block arrangement model to obtain the color block arrangement data of the production line for each production cycle.

[0062] Specifically, by solving the color block arrangement model, the color block arrangement data of the production line for each production cycle can be obtained. The color block arrangement data may include the position, order of each color block within the production cycle, and the number of skids and products within the color block.

[0063] In some embodiments, the color block arrangement data may further include the length of the color block, that is, the number of skids within the color block. Since the length of the skid on the transfer track is fixed, the length of the color block can correspond to the number of skids within the color block.

[0064] S40. Based on the color block arrangement data and the skid data, construct a product arrangement model, which includes a product arrangement function and product arrangement constraint conditions.

[0065] Among them, the product arrangement model can determine the specific product types to be placed on each skid according to the color block arrangement data and the skid situation on the production line. The product arrangement constraint conditions can consider restrictions such as the product arrangement order to ensure a more reasonable product arrangement on each skid.

[0066] S50. Solve the product arrangement model to obtain the product data corresponding to each skid on the production line for each production cycle.

[0067] Finally, solve the product arrangement model to obtain the product data corresponding to each skid on the production line for each production cycle. The product data corresponding to each skid on the production line for each production cycle may include information such as the product types and quantities to be produced on each skid.

[0068] In summary, the product spraying production scheduling method provided by the present invention divides the spraying scheduling process into two stages by means of two-stage discrete modeling. In the first stage, that is, the color block arrangement process, by constructing a color block arrangement model, a complex spraying production scheduling problem is simplified into a color block arrangement problem, and color block arrangement constraint conditions such as color connection relationships are comprehensively considered, and the color block arrangement data within each production cycle is calculated. In the second stage, that is, the product arrangement process, through the product arrangement model, combined with the color block arrangement data and the skid data, the specific arrangement plan for each skid is determined. This product spraying production scheduling method is more scientific than manual scheduling, can avoid subjectivity and arbitrariness in manual scheduling, can fully consider various production factors and constraint conditions, can efficiently formulate production plans, thereby improving the efficiency and quality of spraying production and reducing production costs.

[0069] In addition, in some embodiments, after step S50, the product spraying production scheduling method may further include the step of: establishing a spraying production plan according to the product data corresponding to each skid on the production line in each production cycle.

[0070] That is to say, after step S50, a document of the spraying production plan can be formed according to the product data corresponding to each skid in each production cycle. The spraying production plan may include contents such as a production task allocation table, a time schedule, a resource allocation plan, etc., presenting the entire production plan in a clear and intuitive manner to achieve refined management of the production process. And the spraying production plan can not only enable production personnel to clearly understand the tasks and goals of each production stage, improving the pertinence and efficiency of work; but also provide a basis for monitoring and adjusting the production process, promptly discovering and solving problems occurring in the production process, and ensuring the smooth execution of the production plan.

[0071] In some embodiments, the step of constructing a color block arrangement model based on the skid data and the product data includes:

[0072] According to the skid data and the product data, calculate the number of color types, the total number of product switches between adjacent production cycles, the total number of spraying color switches between adjacent production cycles, and the total number of skids with unmet production requirements;

[0073] According to the number of color types, the total number of product switches between adjacent production cycles, the total number of spraying color switches between adjacent production cycles, and the total number of skids with unmet production requirements, with minimizing the weighted sum as the optimization goal, construct a color block arrangement function.

[0074] Specifically, the quantity of color types is equivalent to the total number of color changes here. For example, within a production cycle, products of multiple colors such as red, blue, green, yellow, etc. may be involved. By counting the number of different color types, this value is the quantity of color types (total number of color changes).

[0075] In this embodiment, whether the s-th color block in the l-th production cycle uses a c-type color for production can be converted into a Boolean value, that is, when the s-th color block in the l-th production cycle uses a c-type color, x s,c,l is 1, otherwise it is zero; by counting all x s,c,l the quantity of color types (total number of color changes) can be obtained, which is more convenient for data processing and improves the efficiency of formulating the scheduling plan. Among them, the increase in the total number of color changes will increase the adjustment time and production cost of the equipment.

[0076] For the total number of product switches between adjacent production cycles, it is necessary to compare the number of products produced in adjacent two production cycles. In this embodiment, the total number of product switches between adjacent production cycles can be obtained in the following way: judge whether the quantity of r-type products of c-type color produced in a certain production cycle is the same as the quantity of r-type products of c-type color produced in the previous production cycle; if different, it means that a product switch has occurred. Among them, too many switch times may lead to an increase in the adjustment and preparation time during the production process, affecting production efficiency.

[0077] For the total number of spray color switches between adjacent production cycles, it is necessary to compare the number of color switches in adjacent production cycles. For example, in a production cycle, the product on a certain skid needs to be sprayed with red, while the product on the same skid in the previous production cycle needs to be sprayed with blue, which is counted as one spray color switch. Among them, frequent color switches will increase the adjustment time and cost of the equipment, affecting production efficiency.

[0078] For the total number of skids with unmet production demand, it is necessary to compare the difference between the actual production plan and the product demand. For each type of product, check whether the actual production plan quantity reaches the demand quantity. If the actual production quantity is less than the demand quantity, the difference is statistically summarized. For example, the demand quantity of a certain product is 100, but only 80 can be produced in the actual production plan, then the quantity of unmet demand products is 20. By analyzing and counting all products in this way, the total number of skids with unmet production demand is obtained, which helps to evaluate the degree to which the layout plan meets the production demand and ensure that production can meet the market demand as much as possible.

[0079] Further, the step of constructing the color block arrangement function with the optimization goal of minimizing the weighted sum according to the quantity of color types, the total number of product switches in adjacent production cycles, the total number of spray color switches in adjacent production cycles, and the total number of skids with unmet production demand further includes the step of determining the weighting coefficients.

[0080] That is, weighting coefficients are assigned to each calculation index (quantity of color types, total number of product switches in adjacent production cycles, total number of spray color switches in adjacent production cycles, and total number of skids with unmet production demand). The magnitude of the weighting coefficient depends on the importance of each index to the optimization of the color block arrangement.

[0081] For example, if it is considered that the total number of spray color switches in adjacent production cycles has the greatest impact on production costs and time, a relatively large weighting coefficient can be assigned to it; if the total number of skids with unmet production demand is more critical for meeting market demand, its weighting coefficient can be adjusted accordingly. By reasonably determining the weighting coefficients, it can be ensured that the optimization goal can comprehensively consider the impacts of various indexes. That is to say, during the execution of the product spray production scheduling method, the weighting coefficients can be determined through empirical judgment or data analysis according to factors such as the production goals, cost structure, and market demand of the enterprise.

[0082] Further, the color block arrangement function may include the following formula:

[0083]

[0084] In the formula, the first term is the quantity of color types (total number of color changes), w1 is the weighting coefficient of the quantity of color types; the second term is the total number of skids with unmet production demand, w2 is the weighting coefficient of the total number of skids with unmet production demand; the third term is the total number of product switches in adjacent production cycles, w3 is the weighting coefficient of the total number of product switches in adjacent production cycles; the fourth term is the total number of spray color switches in adjacent production cycles, w4 is the weighting coefficient of the total number of spray color switches in adjacent production cycles. The color block arrangement function takes the minimization of the weighted sum of the above four terms as the optimization goal, which can reduce the costs brought by color changes and component replacements and can improve production efficiency.

[0085] In some embodiments, the step of calculating the quantity of color types, the total number of product switches in adjacent production cycles, the total number of spray color switches in adjacent production cycles, and the total number of skids with unmet production demand according to the skid data and the product data includes:

[0086] Based on the skid data and the product data, obtain the quantity and color of the color blocks sprayed on the production line in each production cycle;

[0087] If the color sprayed on the s-th color block in the l-th production cycle is the same as the color sprayed on the s-th color block in the (l - 1)-th production cycle, then the Boolean value y indicating the change in the sprayed color between adjacent production cycles is obtained. s,l = 0; otherwise, the Boolean value y indicating the change in the sprayed color between adjacent production cycles s,l = 1;

[0088] Sum up all the Boolean values indicating the change in the sprayed color between adjacent production cycles to obtain the total number of times the sprayed color switches between adjacent production cycles.

[0089] Specifically, the calculation process of the total number of times the sprayed color switches between adjacent production cycles may include: First, based on the skid data and the product data, determine the number of color blocks sprayed in each production cycle on the production line and the corresponding colors; for each color block position (i.e., the s-th color block), it is necessary to compare the sprayed colors in two adjacent production cycles (the l-th production cycle and the (l - 1)-th production cycle).

[0090] If the color sprayed on the s-th color block in the l-th production cycle is the same as the color sprayed on the s-th color block in the (l - 1)-th production cycle, then the obtained Boolean value indicating the change in the sprayed color between adjacent production cycles is 0 (i.e., y s,l = 0, indicating that the color has not changed); otherwise, the Boolean value indicating the change in the sprayed color between adjacent production cycles is 1 (i.e., y s,l = 1, indicating that the color has changed). Then, count all the color block positions on the production line, judge the color change situation at each color block position between adjacent production cycles according to the above method, and record the corresponding Boolean value.

[0091] Sum up the Boolean values indicating the change in the sprayed color between adjacent production cycles corresponding to all color block positions. Since a Boolean value of 1 indicates that the color has changed, when summing up, in fact, it is the accumulation of the Boolean values indicating the change in the sprayed color between adjacent production cycles, and thus the total number of times the sprayed color switches between adjacent production cycles can be obtained.

[0092] Furthermore, the Boolean value indicating the change in the sprayed color between adjacent production cycles can be calculated through the following formula:

[0093]

[0094] where, when the color sprayed on the s-th color block in the (l - 1)-th production cycle is c, the corresponding x s,c,l-1 is equal to 1, and if the color sprayed on the s-th color block in the l-th production cycle is not c, the corresponding x s,c,l is equal to 0, then at this time y s,l = 1. When the color sprayed on the s-th color block in the (l - 1)-th production cycle is c, the corresponding x s,c,l-1is equal to 1, and if the color sprayed on the s-th color patch in the l-th production cycle is c, then the corresponding x s,c,l is equal to 1, then at this time y s,l = 0.

[0095] It should be noted that S = {1, 2, 3 Λ, |s|}, where the value of |s| is an empirical value, which is the maximum number of color patches that will not exceed in a production cycle under normal conditions. Optionally, the |s| can be set to values such as 50, 60, 100, 120, etc., which will not be elaborated one by one here.

[0096] In some embodiments, the step of calculating the quantity of color types, the total number of product switches between adjacent production cycles, the total number of color switches for spraying between adjacent production cycles, and the total number of skids where production does not meet the demand according to the skid data and the product data includes:

[0097] Based on the skid data and the product data, obtain the product types sprayed in each production cycle and the corresponding quantities;

[0098] If the quantity of r products of c-type color sprayed in the (l - 1)-th production cycle is the same as the quantity of r products of c-type color produced in the l-th production cycle, then obtain the Boolean value pd of the change in product quantity between adjacent production cycles c,r,l = 0; otherwise, obtain the Boolean value pd of the change in product quantity between adjacent production cycles c,r,l = 1;

[0099] Accumulate all the Boolean values of the change in product quantity between adjacent production cycles to obtain the total number of product switches between adjacent production cycles.

[0100] Specifically, the calculation process of the total number of product switches between adjacent production cycles may include: First, according to the skid data and the product data, determine the product types sprayed in each production cycle and the corresponding quantities. For example, in the first production cycle, 50 red A products and 30 blue B products may be sprayed; in the second production cycle, 40 red A products, 35 blue B products, and 25 green C products may be sprayed.

[0101] For each product type (such as r products) and each color (such as c-type color), compare the product quantities in two adjacent production cycles (the (l - 1)-th production cycle and the l-th production cycle). For example, assume that r products are A products and c-type color is red. In the (l - 1)-th production cycle, the quantity of red A products is 50; in the l-th production cycle, the quantity of red A products is 40.

[0102] If the quantity p of r products of c-type color sprayed in the (l - 1)-th production cycle c,r,l-1 is the same as the quantity p of r products of c-type color produced in the l-th production cyclec,r,l If they are the same, the Boolean value indicating the change in the product quantity between adjacent production cycles is 0 (i.e., pd c,r,l = 0, indicating no change in quantity); otherwise, the Boolean value indicating the change in the product quantity between adjacent production cycles is 1 (i.e., pd c,r,l = 1, indicating a change in quantity). Continuing with the above example, since 50 is not equal to 40, the Boolean value indicating the change in the product quantity between adjacent production cycles is 1. Then, all possible combinations of product types and colors are traversed, and the change in the product quantity of each combination between adjacent production cycles is judged according to the above method, and the corresponding Boolean value is recorded.

[0103] Accumulate the Boolean values indicating the change in the product quantity of all product and color combinations between adjacent production cycles. Since a Boolean value of 1 indicates a change in quantity, in fact, the number of Boolean values of 1 is counted, and the total number of product switches between adjacent production cycles can be obtained.

[0104] Furthermore, the Boolean value indicating the change in the product quantity between adjacent production cycles can be calculated by the following formula:

[0105]

[0106] In some embodiments, the color block arrangement constraint conditions include at least one of a color uniqueness constraint condition, a continuity constraint condition, a color change limit constraint condition, a bracket upper limit constraint condition, a color order constraint condition, and a demand satisfaction constraint condition. It should be noted that the color uniqueness constraint condition, the continuity constraint condition, the color change limit constraint condition, the bracket upper limit constraint condition, the color order constraint condition, and the demand satisfaction constraint condition can be freely combined according to needs and actual situations. In this embodiment, the color block arrangement constraint conditions cover all of the color uniqueness constraint condition, the continuity constraint condition, the color change limit constraint condition, the bracket upper limit constraint condition, the color order constraint condition, and the demand satisfaction constraint condition.

[0107] The color uniqueness constraint condition may include: there is only one color type in each color block within each production cycle. That is to say, in the process of solving the color block arrangement model in step S30, it can be judged whether the number of colors in the s-th color block in the l-th production cycle is less than or equal to 1; if it is less than or equal to 1, it means that the color uniqueness constraint condition is met; otherwise, the color uniqueness constraint condition is not met.

[0108] Furthermore, the color uniqueness constraint condition may include the following formula:

[0109]

[0110] Specifically, the judgment of the color uniqueness constraint condition can also be made by accumulating the Boolean values of using color c for the s-th color block in the l-th production cycle. If the s-th color block in the l-th production cycle uses one color or no color, then x s,c,l is less than or equal to 1, and at this time, it meets the color uniqueness constraint condition; if the s-th color block in the l-th production cycle uses two or more colors, then the cumulative value of x s,c,l is greater than 1, and at this time, it does not meet the color uniqueness constraint condition.

[0111] The continuity constraint condition emphasizes that the color blocks should maintain a certain continuity during the arrangement process, and excessive color switching or discontinuity should be avoided as much as possible between adjacent color blocks. Among them, the continuity constraint condition may include an end constraint condition, and the end constraint condition means that within the same production cycle, no color filling is allowed after the unfilled color block. That is, in the l-th production cycle, when the s-th color block is not sprayed with color, the s + 1-th color block must also not be sprayed with color.

[0112] Furthermore, the end constraint condition may include the following formula:

[0113]

[0114] Specifically, when the s-th color block in the l-th production cycle is not sprayed with color, x s,c,l is equal to 0, and at this time, x s+1,c,l must also be equal to 0, indicating that the s + 1-th color block in the l-th production cycle is also not sprayed with color.

[0115] In addition, the continuity constraint condition may also include an adjacent color block constraint condition, and the adjacent color block constraint condition means that the colors of two adjacent color blocks cannot be the same within the same production cycle, otherwise they are the same color block. That is, the colors of the s-th color block and the s + 1-th color block in the same production cycle cannot be the same.

[0116] Furthermore, the adjacent color block constraint condition may include the following formula:

[0117]

[0118] Specifically, when the color sprayed on the s-th color block in the l-th production cycle is c, x s,c,l is equal to 1, then x s+1,c,l must be equal to 0, that is, the color sprayed on the s + 1-th color block in the l-th production cycle cannot be color c.

[0119] In some embodiments, the color change restriction constraint may include a first restriction constraint and a second restriction constraint. The first restriction constraint means that at the end of each color change operation or each production cycle, an empty skid or a primer part must be placed. The second restriction constraint means that all skids within each production cycle must have products placed on them.

[0120] Among them, the first restriction constraint is used to isolate the possible color residues during the color change process and the spraying end process from the products to be sprayed subsequently. When the spraying equipment completes the color change operation or is about to complete spraying, the empty skid is sprayed first. In this way, even if there are some color residues, it will not affect the color quality of the actual products.

[0121] The second restriction constraint means that all skids within each production cycle must have products placed on them, which means that there cannot be idle skids, and production resources should be fully utilized to improve production efficiency. If a skid does not have a product placed on it during a certain production cycle, it will cause a waste of production resources and increase production costs.

[0122] Furthermore, the color change restriction constraint may further include the following formula:

[0123]

[0124] pr c,r,l ×suport r,n,l =p c,r,l 。

[0125] Specifically, the sum of the number of skids with products placed on them and the empty skids or primer parts brought about by color change is the total number of actual skids on the production line. For example, within a production cycle, if there are originally 100 skids on the production line, 90 of which have products placed on them, and 10 empty skids or primer parts are placed due to the color change operation, then the sum of these 90 skids with products and 10 empty skids or primer parts is exactly equal to the total number of 100 actual skids on the production line.

[0126] In some embodiments, the bracket upper limit constraint may include that the number of brackets required for the skids of each product to load parts within each production cycle cannot exceed the total amount of brackets stored on the production line.

[0127] Furthermore, the bracket upper limit constraint may further include the following formula:

[0128]

[0129] Specifically, when color type c is not sprayed in the l-th production cycle, that is, x s,c,lIf it is zero, the number of loading skids of color c in this production cycle is zero; otherwise, the number of brackets required for the loading skids cannot exceed the total amount of brackets stored on the production line.

[0130] In some embodiments, the color sequence constraint condition may include a first color sequence constraint condition, and the first color sequence constraint condition indicates that color patch c2 cannot be arranged adjacent to color patch c1 in a production cycle.

[0131] The first color sequence constraint condition may include the following formula:

[0132]

[0133] In some embodiments, the color sequence constraint condition may further include a second color sequence constraint condition, and the second color sequence constraint condition indicates that color patch c1 and color patch c2 cannot be arranged adjacent to each other in a production cycle.

[0134] The second color sequence constraint condition may include the following formula:

[0135]

[0136] In some embodiments, the color sequence constraint condition may further include a third color sequence constraint condition, and the third color sequence constraint condition indicates that color patch c2 must be arranged adjacent to color patch c2 in a production cycle.

[0137] The third color sequence constraint condition may include the following formula:

[0138]

[0139] In some embodiments, the demand satisfaction constraint condition includes: in a production cycle, the sum of the production quantity of each product of each color and the quantity of unmet demand is greater than or equal to the total demand. The demand satisfaction constraint condition can ensure that the color patch arrangement must meet the production demand of the product.

[0140] Further, the demand satisfaction constraint condition may include the following formula:

[0141]

[0142] In some embodiments, the step of constructing a product arrangement model based on the color patch arrangement data and the skid data includes:

[0143] Based on the color patch arrangement data and the skid data, obtain the product type on each skid in each production cycle;

[0144] Based on the product type on each skid for each production cycle, record the number of times the product type on the skid changes in adjacent production cycles;

[0145] Take the sum of minimizing the number of times the product type on the skid changes in adjacent production cycles as the optimization goal, and construct a product layout function.

[0146] Specifically, during the execution of step S40, first, according to the skid data on the production line and the above step S30, obtain the color block layout data, establish the association relationship between the skid and the color block, and accurately correspond each color block to each skid. For example, according to the color block positions recorded in the color block layout data, combined with the moving order of the skids on the production line, determine the skids covered by each color block.

[0147] Then, according to the color block layout data and product information, determine the product type to be sprayed on each skid for each production cycle. Subsequently, for each skid, compare the product type in the current production cycle with the product type in the previous production cycle. If the two are different, record a change in the change recording mechanism. And traverse each skid in sequence according to the sequence of production cycles.

[0148] Finally, count the number of times the product type on each skid changes in adjacent production cycles, and take the sum of minimizing the number of times the product type on the skid changes in adjacent production cycles as the optimization goal to construct a product layout model.

[0149] Among them, the optimization goal of the product layout model is to minimize the sum of the number of times the product type on the skid changes in adjacent production cycles. Reducing the change of product type can reduce production adjustment costs and improve production efficiency.

[0150] In this embodiment, the product layout function may include the following formula:

[0151]

[0152] Further, the step of recording the number of times the product type on the skid changes in adjacent production cycles based on the product type on each skid for each production cycle includes:

[0153] Based on the product type on each skid for each production cycle, obtain the product type on the nth skid in the lth production cycle and the product type on the nth skid in the (l - 1)th production cycle;

[0154] If the product type on the nth skid in the lth production cycle is the same as the product type on the nth skid in the (l - 1)th production cycle, obtain the Boolean value zd of the product switch on the skid in adjacent production cycles n,l= 0; otherwise, the Boolean value zd for the product on the skid during the switch between adjacent production cycles n,l = 1;

[0155] Accumulate all the Boolean values for the product on the skid during the switch between adjacent production cycles to obtain the number of times the product type on the skid changes between adjacent production cycles.

[0156] Specifically, first, obtain the product type on the nth skid in the lth production cycle and the product type on the nth skid in the (l - 1)th production cycle. Then, determine whether these two product types are the same and determine a Boolean value based on the judgment result. If the product type on the nth skid in the lth production cycle is the same as the product type on the nth skid in the (l - 1)th production cycle, it means that the product on this skid has not switched between adjacent production cycles. At this time, we set the Boolean value for the product on the skid during the switch between adjacent production cycles to 0. For example, assume that the product type on the nth skid in the (l - 1)th production cycle is "A" and the product type on the nth skid in the lth production cycle is also "A", then the corresponding Boolean value is 0.

[0157] If the product type on the nth skid in the lth production cycle is different from the product type on the nth skid in the (l - 1)th production cycle, it means that the product on this skid has switched between adjacent production cycles. At this time, we set the Boolean value for the product on the skid during the switch between adjacent production cycles to 1. For example, if the product type on the nth skid in the (l - 1)th production cycle is "B" and the product type on the nth skid in the lth production cycle is "C", then the corresponding Boolean value is 1.

[0158] Subsequently, traverse all the skids in sequence according to the skid number. For each skid, accumulate the Boolean value obtained from the previous judgment into the counter. For example, if there are 5 skids and the Boolean values obtained from the judgment are 0, 1, 0, 1, 1 respectively, then accumulate these Boolean values into the counter in sequence, and finally the value of the counter is 3, that is, the number of times the product type on the skid changes between adjacent production cycles is 3.

[0159] In the above calculation process of the number of times the product type on the skid changes between adjacent production cycles, the change of the product type can be transformed into the accumulation of Boolean values, so that the number of times the product type on the skid changes between adjacent production cycles can be obtained clearly and accurately. This data will provide an important basis for subsequent construction of the product layout model and optimization of the production schedule, and help improve production efficiency and product quality.

[0160] Furthermore, the calculation process of the Boolean value for the product on the skid during the switch between adjacent production cycles can be expressed by the following formula:

[0161]

[0162] In some embodiments, the product arrangement constraint conditions include at least one of a product uniqueness constraint condition, a product certainty constraint condition within a color block, and a product sequence constraint condition. In this embodiment, the product arrangement constraint conditions cover all of a product uniqueness constraint condition, a product certainty constraint condition within a color block, and a product sequence constraint condition.

[0163] Among them, the product uniqueness constraint condition includes that only one type of product can be placed on each skid in each production cycle.

[0164] Further, the product uniqueness constraint condition may include the following formula:

[0165]

[0166] Specifically, when only product r is produced on the nth skid in the lth production cycle, z n,r,l is equal to 1; otherwise, the z n,r,l is equal to 0.

[0167] The product certainty constraint condition within a color block includes that the number of product r of color c placed in each color block in each production cycle is a fixed value, which is the solution result of the above step S30.

[0168] Further, the product certainty constraint condition within a color block may include the following formula:

[0169]

[0170] The product sequence constraint condition may include a first product sequence constraint condition, and the first product sequence constraint condition means that product r1 cannot be arranged immediately behind product r2 in a production cycle.

[0171] Optionally, the first product sequence constraint condition may include the following formula:

[0172]

[0173] In some embodiments, the product sequence constraint condition may further include a second product sequence constraint condition, and the second product constraint condition means that product r1 and product r2 cannot be arranged adjacent to each other in a production cycle.

[0174] Optionally, the second product sequence constraint condition may include the following formula:

[0175]

[0176] In addition, it should be clear that Figure 1The flow diagram of the product spraying production scheduling method shown therein presents the step sequence merely based on the logical sequence provided by one of the numerous embodiments of the present invention. This sequence aims to clearly illustrate the execution process of the method in a specific application scenario. However, in practical applications, the flexibility and scalability of the present invention allow technicians to adjust the sequence of the above steps according to different actual requirements and environmental conditions. For example, there may be a parallel or juxtaposed relationship between some steps, which will not be elaborated one by one here.

[0177] Reference Figure 2 , which is a schematic structural diagram of a product spraying production scheduling device 100 provided by an embodiment of the present invention. The product spraying production scheduling device 100 includes an acquisition module 110, a color block arrangement model construction module 120, a color block arrangement solution module 130, a product arrangement model construction module 140, and a product arrangement model solution module 150. The above-mentioned modules are electrically connected to realize the transmission and reception of information. Of course, in some embodiments, the acquisition module 110, the color block arrangement model construction module 120, the color block arrangement solution module 130, the product arrangement model construction module 140, and the product arrangement model solution module 150 can also be integrated into one body to make the overall structure more compact.

[0178] Among them, the acquisition module 110 is used to acquire the skid data on the production line and the product data to be sprayed, and the product data includes the product type and the color information to be sprayed for each type of product.

[0179] The color block arrangement model construction module 120 is used to construct a color block arrangement model according to the skid data and the product data collected by the acquisition module 110. The color block arrangement model includes a color block arrangement function and color block arrangement constraint conditions;

[0180] The color block arrangement solution module 130 is used to solve the color block arrangement model established by the color block arrangement model construction module 120 to obtain the color block arrangement data of the production line in each production cycle;

[0181] The product arrangement model construction module 140 is used to construct a product arrangement model according to the color block arrangement data obtained by the solution of the color block arrangement solution module 130 and the skid data collected by the acquisition module 110. The product arrangement model includes a product arrangement function and product arrangement constraint conditions;

[0182] The product arrangement model solution module 150 is used to solve the product arrangement model established by the product arrangement model construction module 140 to obtain the product data corresponding to each skid on the production line in each production cycle.

[0183] It should be noted that the product spraying production scheduling device provided in the embodiments of the present application has the same implementation principle and technical effects as those in the foregoing embodiments of the product spraying production scheduling method. For the sake of brief description, for the parts not mentioned in the device embodiments, reference may be made to the corresponding content in the foregoing embodiments of the product spraying production scheduling method.

[0184] Reference Figure 3 , which is a schematic hardware structure diagram of an electronic device provided in an embodiment of the present invention. The electronic device provided in this embodiment includes a processor 210 and a memory 220. The memory 220 stores machine-readable instructions executable by the processor 210. When the machine-readable instructions are executed by the processor 210, the steps in the product spraying production scheduling method described in any of the foregoing embodiments are executed. Among them, at least one of the processor 210 and the memory 220 is provided.

[0185] In this embodiment, the electronic device further includes a communication interface 230 and a communication bus 240. Among them, the processor 210, the memory 220, and the communication interface 230 are connected to each other through the communication bus 240. The communication bus 240 can be divided into an address bus, a data bus, a control bus, etc. For the sake of convenience of representation, Figure 3 only a thick line is used to represent the communication bus 240 in [ ], but it does not mean that there is only one communication bus 240 or one type of communication bus 240. The processor 210 can also be called a controller, and there is no limitation on the name.

[0186] In the embodiments of the present application, the memory 220 stores instructions executable by at least one processor 210. By executing the instructions stored in the memory 220, at least one processor 210 can execute the steps in the product spraying production scheduling method described above. The processor 210 can implement Figure 3 the functions of each module in the device shown in [ ].

[0187] Among them, the processor 210 is the control center of the device. It can connect various parts of the entire control device through various interfaces and lines. By running or executing the instructions stored in the memory 220 and calling the data stored in the memory 220, various functions of the device and process data, so as to monitor the device as a whole.

[0188] In a possible design, the processor 210 may include one or more processing units. The processor 210 may integrate an application processor and a modulation and demodulation processor. Among them, the application processor mainly processes the operating system, the operating body interface, application programs, etc., and the modulation and demodulation processor mainly processes wireless communication. It can be understood that the above modulation and demodulation processor may not be integrated into the processor. In some embodiments, the processor 210 and the memory 220 can be implemented on the same chip or separately on independent chips.

[0189] The processor 210 may be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the product spraying production scheduling method disclosed in combination with the embodiments of the present application may be directly embodied as being executed by a hardware processor, or executed by a combination of hardware and software modules in the processor.

[0190] The memory 220, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The memory 220 may include at least one type of storage medium, for example, it may include flash memory, a hard disk, a multimedia card, a card-type memory, a random access memory (RAM), a static random access memory (SRAM), a programmable read-only memory (PROM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic memory, a magnetic disk, an optical disk, etc. The memory 220 is any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. The memory 220 in the embodiments of the present application may also be a circuit or any other device that can implement a storage function, for storing program instructions and / or data.

[0191] By designing and programming the processor 210, the code corresponding to the product spraying production scheduling method introduced in the foregoing embodiments can be solidified into the chip, so that the chip can execute Figure 2 the steps of the product spraying production scheduling method of the embodiments shown. How to design and program the processor 210 is a well-known technology to those skilled in the art and will not be elaborated here.

[0192] The embodiments of the present application further provide a computer-readable storage medium. Computer-executable instructions are stored in the computer-readable storage medium. When the computer-executable instructions are executed by the processor 210, they are used to implement the product spraying production scheduling method described in any of the foregoing embodiments. Therefore, details will not be repeated here. In addition, the beneficial effects of the same method will not be described again. For the technical details not disclosed in the embodiments of the computer storage medium involved in the present invention, please refer to the description of the method embodiments of the present invention.

[0193] In some possible implementation manners, various aspects of the product spraying production scheduling method provided by the present application can also be implemented in the form of a program product, which includes program code. When the program product runs on a device, the program code is used to cause the control device to execute the steps in the product spraying production scheduling method according to various exemplary embodiments of the present application described above in this specification.

[0194] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0195] The present application is described with reference to the flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each flow and / or block in the flowchart and / or block diagram, and the combination of flows and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, such that the instructions executed by the processor of the computer or other programmable data processing devices generate a device for implementing the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0196] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, such that the instructions stored in the computer-readable memory generate a manufactured article including an instruction device, and the instruction device implements the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0197] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus, causing a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, so that the instructions executed on the computer or other programmable apparatus provide steps for implementing the functions specified in one flow Figure 1 one flow or more flows and / or boxes Figure 1 steps for implementing the functions specified in one box or more boxes.

[0198] In addition, any process or method description in a flowchart or described otherwise herein can be understood to represent a module, segment, or portion of code including one or more executable instructions for implementing a customized logic function or process, and the scope of the preferred embodiments of the present invention includes additional implementations in which functions may be executed not in the order shown or discussed, including in substantially simultaneous manners according to the relevant functions or in reverse order, which should be understood by those skilled in the art to which the embodiments of the present invention pertain.

[0199] Although the embodiments of the present invention have been shown and described above, it can be understood that the above embodiments are exemplary and should not be construed as limiting the present invention. Those of ordinary skill in the art can make changes, modifications, substitutions, and variations to the above embodiments within the scope of the present invention.

Claims

1. A product spraying production scheduling method, characterized in that, It includes the following steps: Obtain the skid data and product data to be sprayed on the production line. The product data includes the type of the product and the color information to be sprayed for each type of product; Based on the skid data and the product data, construct a color block arrangement model, which includes a color block arrangement function and color block arrangement constraint conditions; Solve the color block arrangement model to obtain the color block arrangement data of the production line in each production cycle; Based on the color block arrangement data and the skid data, construct a product arrangement model, which includes a product arrangement function and product arrangement constraint conditions; Solve the product arrangement model to obtain the product data corresponding to each skid on the production line in each production cycle.

2. The product spraying production scheduling method according to claim 1, wherein The step of constructing a color block arrangement model based on the skid data and the product data includes: According to the skid data and the product data, calculate the number of color types, the total number of product switches in adjacent production cycles, the total number of spray color switches in adjacent production cycles, and the total number of skids with unmet production requirements; Based on the number of color types, the total number of product switches in adjacent production cycles, the total number of spray color switches in adjacent production cycles, and the total number of skids with unmet production requirements, construct a color block arrangement function with minimizing the weighted sum as the optimization objective.

3. The product spraying production scheduling method according to claim 2, wherein, The step of calculating the number of color types, the total number of product switches in adjacent production cycles, the total number of spray color switches in adjacent production cycles, and the total number of skids with unmet production requirements according to the skid data and the product data includes: Based on the skid data and the product data, obtain the number of color blocks and the color of the color blocks sprayed in each production cycle of the production line; If the color sprayed on the s-th color patch in the l-th production cycle is the same as the color sprayed on the s-th color patch in the (l - 1)-th production cycle, then the Boolean value y indicating the change in the sprayed color between adjacent production cycles is obtained s,l = 0; Otherwise, the Boolean value y indicating the change in the sprayed color between adjacent production cycles s,l = 1; Accumulate the Boolean values of all the spray colors that change in adjacent production cycles to obtain the total number of spray color switches in adjacent production cycles.

4. The product spraying production scheduling method according to claim 2, wherein, The step of calculating the number of color types, the total number of product switches in adjacent production cycles, the total number of spray color switches in adjacent production cycles, and the total number of skids with unmet production requirements according to the skid data and the product data includes: Based on the skid data and the product data, obtain the product types and the corresponding quantities sprayed in each production cycle; If the quantity of product r with color c sprayed in the (l - 1)-th production cycle is the same as the quantity of product r with color c produced in the l-th production cycle, then obtain the Boolean value pd indicating the change in the quantity of products in adjacent production cycles c,r,l = 0; otherwise, obtain the Boolean value pd c,r,l = 1; Accumulate the Boolean values of all the product quantities that change in adjacent production cycles to obtain the total number of product switches in adjacent production cycles.

5. The product spraying production scheduling method according to claim 2, wherein, The color block arrangement constraint conditions include at least one of a color uniqueness constraint condition, a continuity constraint condition, a color change limit constraint condition, a bracket upper limit constraint condition, a color sequence constraint condition, and a demand satisfaction constraint condition.

6. The product spraying production scheduling method according to claim 1, wherein The step of constructing a product arrangement model based on the color block arrangement data and the skid data includes: Based on the color block arrangement data and the skid data, obtain the product types on each skid in each production cycle; Based on the product types on each skid in each production cycle, record the number of times the product types on the skids change in adjacent production cycles; Take minimizing the sum of the number of times the product types on the skids change in adjacent production cycles as the optimization objective and construct a product arrangement function.

7. The product spraying production scheduling method according to claim 6, wherein The step of recording the number of times the product type on the skid changes in adjacent production cycles based on the product type on each skid in each production cycle includes: Based on the product type on each skid in each production cycle, obtain the product type on the nth skid in the lth production cycle and the product type on the nth skid in the (l - 1)th production cycle; If the product type on the nth skid in the lth production cycle is the same as the product type on the nth skid in the (l - 1)th production cycle, the Boolean value zd for the product on the skid to switch between adjacent production cycles is obtained n,l = 0; otherwise, the Boolean value zd for the product on the skid to switch between adjacent production cycles n,l = 1; Accumulate the Boolean values of the product switches on all the skids in adjacent production cycles to obtain the number of times the product type on the skid changes in adjacent production cycles.

8. The product spraying production scheduling method according to claim 6, characterized in that, The product layout constraint conditions include at least one of a product uniqueness constraint condition, a product certainty constraint condition within a color block, and a product order constraint condition.

9. A product spraying production scheduling device, characterized in that, It includes: An acquisition module, which is used to acquire skid data on the production line and product data to be sprayed, and the product data includes product type and color information to be sprayed for each type of product; A color block layout model construction module, which is used to construct a color block layout model according to the skid data and the product data, and the color block layout model includes a color block layout function and color block layout constraint conditions; A color block layout solution module, which is used to solve the color block layout model to obtain the color block layout data of the production line in each production cycle; A product layout model construction module, which is used to construct a product layout model according to the color block layout data and the skid data, and the product layout model includes a product layout function and product layout constraint conditions; A product layout model solution module, which is used to solve the product layout model to obtain the product data corresponding to each skid on the production line in each production cycle.

10. An electronic device, characterized in that, It includes a processor and a memory, the memory stores machine-readable instructions executable by the processor, and when the machine-readable instructions are executed by the processor, the steps in the product spraying production scheduling method according to any one of claims 1-8 are executed.

Images