A dyeing machine auxiliary agent delivery control method, device, system and terminal equipment

Abstract

The application discloses a dyeing machine auxiliary agent delivery control method, device, system and terminal equipment, after obtaining the auxiliary agent demand time point and auxiliary agent transportation time length of multiple dyeing machines, the arrangement sequence of the dyeing machines is arranged and obtained, and multiple local demand conflict machine groups are generated, in each local demand conflict machine group, the scheduling sequence of the dyeing machines is obtained through a preset time optimization algorithm, and the scheduling sequence of the dyeing machines in each local demand conflict machine group and the arrangement sequence of the multiple local demand conflict machine groups are combined, so that the auxiliary agent scheduling scheme of the multiple dyeing machines is obtained, so that the delivery equipment can complete the delivery control of the dyeing machine auxiliary agent according to the auxiliary agent scheduling scheme. The application disassembles the demand conflicts of the multiple dyeing machine auxiliary agents into local demand conflicts, and performs scheduling control of the dyeing machine auxiliary agent through local optimization, compared with manual dyeing machine auxiliary agent scheduling, the application can reduce the waiting time of the dyeing machines in the workshop as a whole, and improve the delivery efficiency of the dyeing machine auxiliary agent.

Description

Technical Field

[0001] This invention relates to the field of intelligent scheduling, and in particular to a method, apparatus, system and terminal equipment for controlling the delivery and distribution of dyeing machine auxiliaries. Background Technology

[0002] The existing dyeing machine auxiliary agent delivery system delivers auxiliary agents according to the actual production needs of the dyeing machine managed by the workshop workers, which lacks an optimized scheduling method, resulting in low auxiliary agent delivery efficiency and uncertainty and instability due to manual operation.

[0003] In a dyeing and printing workshop, one worker is typically responsible for the operation and coordination of several dyeing machines. When a worker discovers that a dyeing machine needs auxiliaries, the worker assists in making a call to the auxiliary agent delivery system. Current technology suffers from delays in manual operation, and the auxiliary agent delivery system delivers agents sequentially according to the call time, lacking an optimized scheduling process. This results in long overall waiting times for dyeing machines in the workshop, leading to low efficiency.

[0004] Therefore, there is an urgent need for a control strategy for the delivery and distribution of dyeing machine auxiliaries to solve the problem of low efficiency in the delivery and distribution of dyeing machine auxiliaries in the current workshop. Summary of the Invention

[0005] This invention provides a method, apparatus, system, and terminal equipment for controlling the delivery of dyeing machine auxiliaries, in order to improve the delivery efficiency of dyeing machine auxiliaries in the front workshop.

[0006] To address the above problems, one embodiment of the present invention provides a method for controlling the delivery and distribution of dyeing machine auxiliaries, comprising:

[0007] Obtain the auxiliary agent demand time points and auxiliary agent transportation time for several dyeing machines, and generate an arrangement order for several dyeing machines based on the chronological order of the auxiliary agent demand time points;

[0008] Based on the arrangement order of the dyeing machines, the time point of the auxiliary agent demand, and the transportation time of the auxiliary agent, the dyeing machines are divided into several groups of machines with local demand conflicts, and the arrangement order of the several groups of machines with local demand conflicts is obtained.

[0009] Based on the auxiliary agent transportation time corresponding to the dyeing machine in each of the local demand conflicting machine groups, the scheduling order of the dyeing machines in each of the local demand conflicting machine groups is obtained through a preset time optimization algorithm.

[0010] Based on the arrangement order of several local demand conflict machine groups and the scheduling order of dyeing machines in each local demand conflict machine group, an auxiliary agent scheduling scheme for several dyeing machines is obtained, and the auxiliary agent scheduling scheme is transmitted to the delivery equipment so that the delivery equipment can perform auxiliary agent delivery based on the auxiliary agent scheduling scheme for several dyeing machines.

[0011] As an improvement to the above solution, the dyeing machines are divided into several locally conflicting groups based on their arrangement, the timing of auxiliary agent demand, and the duration of auxiliary agent transportation. Specifically:

[0012] Based on the auxiliary agent demand time and auxiliary agent transportation time for each dyeing machine, the delivery completion time for each dyeing machine is obtained.

[0013] Based on the delivery completion time of each dyeing machine and the auxiliary agent demand time of each dyeing machine, and according to the arrangement order of the dyeing machines, determine whether there is a conflict in the auxiliary agent demand between each pair of adjacent dyeing machines.

[0014] If so, the two dyeing machines corresponding to the demand conflict of auxiliary agents will be assigned to the same local demand conflict machine group;

[0015] If not, the two dyeing machines with non-conflicting auxiliary agent requirements will be assigned to different but adjacent local demand conflicting machine groups.

[0016] After determining the auxiliary agent requirements of several dyeing machines, several clusters of machines with local demand conflicts are generated.

[0017] As an improvement to the above scheme, the step of obtaining the scheduling order of the dyeing machines in each of the local demand conflicting machine groups based on the auxiliary agent transportation time corresponding to the dyeing machines in each local demand conflicting machine group, through a preset time optimization algorithm, specifically involves:

[0018] Obtain the number N of coloring machines in each of the local demand conflicting machine clusters, and calculate N! * N coloring machine pre-arrangement orders based on the number N of coloring machines;

[0019] Substituting the pre-arranged order of the dyeing machines and the auxiliary agent transportation time corresponding to the dyeing machines in each of the local demand conflict machine groups into the time optimization algorithm model, the shortest waiting time for each local demand conflict machine group is calculated.

[0020] Select the dyeing machine pre-arrangement order corresponding to the shortest waiting time to obtain the scheduling order of dyeing machines in each of the local demand conflict machine groups.

[0021] As an improvement to the above scheme, the pre-arrangement order of the dyeing machines and the auxiliary agent transportation time corresponding to the dyeing machines in each local demand conflict group are substituted into the time optimization algorithm model to calculate the shortest waiting time in each local demand conflict group. Specifically:

[0022] The pre-arrangement order of the N! * N dyeing machines and the auxiliary agent transport time t corresponding to the dyeing machines in each local demand conflict group are determined.N Substituting this into the time optimization algorithm model, the waiting time ts corresponding to the coloring machine in each locally conflicting cluster is calculated. N！ ′;

[0023] Compare each waiting time ts N！ The algorithm obtains the shortest waiting time in each cluster of machines with local demand conflicts; wherein the time optimization algorithm model is as follows:

[0024]

[0025] As an improvement to the above scheme, obtaining the arrangement order of the plurality of local demand conflict machine groups specifically involves: comparing the auxiliary agent demand time points of the first dyeing machine in each local demand conflict machine group with the auxiliary agent demand time points of the plurality of dyeing machines according to the chronological order, and obtaining the arrangement order of the plurality of local demand conflict machine groups.

[0026] As an improvement to the above solution, the specific steps for obtaining the auxiliary agent requirements and transportation time for several dyeing machines are as follows:

[0027] Acquire basic data from several dyeing machines transmitted by the MES system; the basic data includes: process information, dyeing machine auxiliary agent requirement time, required types and quantities;

[0028] Based on the aforementioned basic data, the time points for auxiliary agent demand and the duration of auxiliary agent transportation for several dyeing machines are identified and extracted.

[0029] Accordingly, one embodiment of the present invention also provides a dyeing machine auxiliary agent delivery and control device, including: a data acquisition module, a machine cluster generation module, a data generation module, and a delivery control module;

[0030] The data acquisition module is used to acquire the auxiliary agent demand time points and auxiliary agent transportation time of several dyeing machines, and generate an arrangement order of several dyeing machines based on the chronological order of the auxiliary agent demand time points.

[0031] The cluster generation module is used to divide the dyeing machines into several clusters with local demand conflicts based on the arrangement order of the dyeing machines, the time point of the auxiliary agent demand, and the transportation time of the auxiliary agent, and to obtain the arrangement order of the several clusters with local demand conflicts.

[0032] The data generation module is used to obtain the scheduling order of the dyeing machines in each of the local demand conflicting machine groups based on the auxiliary agent transportation time corresponding to the dyeing machines in each local demand conflicting machine group, through a preset time optimization algorithm.

[0033] The delivery control module is used to obtain an auxiliary agent scheduling scheme for the dyeing machines based on the arrangement order of the several local demand conflict machine groups and the scheduling order of the dyeing machines in each local demand conflict machine group, and transmit the auxiliary agent scheduling scheme to the delivery equipment so that the delivery equipment can perform auxiliary agent delivery based on the auxiliary agent scheduling scheme of the several dyeing machines.

[0034] As an improvement to the above solution, the dyeing machines are divided into several locally conflicting groups based on their arrangement, the timing of auxiliary agent demand, and the duration of auxiliary agent transportation. Specifically:

[0035] Based on the auxiliary agent demand time and auxiliary agent transportation time for each dyeing machine, the delivery completion time for each dyeing machine is obtained.

[0036] Based on the delivery completion time of each dyeing machine and the auxiliary agent demand time of each dyeing machine, and according to the arrangement order of the dyeing machines, determine whether there is a conflict in the auxiliary agent demand between each pair of adjacent dyeing machines.

[0037] If so, the two dyeing machines corresponding to the demand conflict of auxiliary agents will be assigned to the same local demand conflict machine group;

[0038] If not, the two dyeing machines with non-conflicting auxiliary agent requirements will be assigned to different but adjacent local demand conflicting machine groups.

[0039] After determining the auxiliary agent requirements of several dyeing machines, several clusters of machines with local demand conflicts are generated.

[0040] As an improvement to the above solution, the data generation module includes: a data processing unit, a time optimization unit, and a result generation unit;

[0041] The data processing unit is used to obtain the number N of dyeing machines in each of the local demand conflicting machine groups, and calculate N! * N dyeing machine pre-arrangement orders based on the number N of dyeing machines;

[0042] The time optimization unit is used to input the pre-arranged order of the dyeing machines and the auxiliary agent transportation time corresponding to the dyeing machines in each of the local demand conflict machine groups into the time optimization algorithm model to calculate the shortest waiting time for each local demand conflict machine group.

[0043] The result generation unit is used to select the pre-arrangement order of the dyeing machines corresponding to the shortest waiting time, and obtain the scheduling order of the dyeing machines in each of the local demand conflict machine groups.

[0044] As an improvement to the above scheme, the pre-arrangement order of the dyeing machines and the auxiliary agent transportation time corresponding to the dyeing machines in each local demand conflict group are substituted into the time optimization algorithm model to calculate the shortest waiting time in each local demand conflict group. Specifically:

[0045] The pre-arrangement order of the N! * N dyeing machines and the auxiliary agent transport time t corresponding to the dyeing machines in each local demand conflict group are determined. N Substituting this into the time optimization algorithm model, the waiting time ts corresponding to the coloring machine in each locally conflicting cluster is calculated. N！ ′;

[0046] Compare each waiting time ts N！ The algorithm obtains the shortest waiting time in each cluster of machines with local demand conflicts; wherein the time optimization algorithm model is as follows:

[0047]

[0048] As an improvement to the above scheme, obtaining the arrangement order of the plurality of local demand conflict machine groups specifically involves: comparing the auxiliary agent demand time points of the first dyeing machine in each local demand conflict machine group with the auxiliary agent demand time points of the plurality of dyeing machines according to the chronological order, and obtaining the arrangement order of the plurality of local demand conflict machine groups.

[0049] As an improvement to the above solution, the specific steps for obtaining the auxiliary agent requirements and transportation time for several dyeing machines are as follows:

[0050] Acquire basic data from several dyeing machines transmitted by the MES system; the basic data includes: process information, dyeing machine auxiliary agent requirement time, required types and quantities;

[0051] Based on the aforementioned basic data, the time points for auxiliary agent demand and the duration of auxiliary agent transportation for several dyeing machines are identified and extracted.

[0052] Accordingly, one embodiment of the present invention also provides a dyeing machine auxiliary agent delivery and control system, including: an intelligent scheduling module, an enterprise resource planning system, a manufacturing execution system, a delivery device, and a dyeing machine; wherein, the intelligent scheduling module is applied to the dyeing machine auxiliary agent delivery and control method as described in the present invention, the enterprise resource planning system is connected to the manufacturing execution system, the manufacturing execution system is connected to the intelligent scheduling module, the intelligent scheduling module is connected to the delivery device, and the delivery device is connected to the dyeing machine.

[0053] Accordingly, one embodiment of the present invention also provides a computer terminal device, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor executes the computer program to implement a dyeing machine auxiliary agent delivery control method as described in the present invention.

[0054] Accordingly, one embodiment of the present invention also provides a computer-readable storage medium, the computer-readable storage medium including a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to perform a dyeing machine auxiliary agent delivery control method as described in the present invention.

[0055] As can be seen from the above, the present invention has the following beneficial effects:

[0056] This invention provides a method for controlling the delivery and distribution of dyeing machine auxiliaries. After obtaining the auxiliary demand time points and transportation durations for multiple dyeing machines, the method arranges the machines into a specific order and generates multiple local demand conflict groups. Within each local demand conflict group, a preset time optimization algorithm is used to obtain the scheduling order of the dyeing machines. The order of the dyeing machines in each local demand conflict group is combined with the arrangement order of the multiple local demand conflict groups to obtain an auxiliary scheduling scheme for the multiple dyeing machines. This allows the delivery equipment to control the delivery and distribution of dyeing machine auxiliaries according to the scheme. This invention decomposes the demand conflicts of multiple dyeing machine auxiliaries into local demand conflicts and performs scheduling control of dyeing machine auxiliaries through local optimization. Compared to manual scheduling of dyeing machine auxiliaries, this invention can reduce the overall waiting time of the dyeing machines in the workshop and improve the delivery and distribution efficiency of dyeing machine auxiliaries. Attached Figure Description

[0057] Figure 1 This is a schematic flowchart of a dyeing machine auxiliary agent delivery and control method provided in an embodiment of the present invention;

[0058] Figure 2 This is a schematic diagram of the structure of a dyeing machine auxiliary agent delivery and control device according to an embodiment of the present invention;

[0059] Figure 3 This is a schematic diagram of the structure of a dyeing machine auxiliary agent delivery and distribution control system provided in an embodiment of the present invention;

[0060] Figure 4 This is a schematic diagram of the scheduling process of the dyeing machine auxiliary agent delivery control system provided in an embodiment of the present invention;

[0061] Figure 5 This is a schematic diagram of a terminal device structure provided in an embodiment of the present invention. Detailed Implementation

[0062] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. 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.

[0063] Example 1

[0064] See Figure 1 , Figure 1 This is a schematic flowchart of a dyeing machine auxiliary agent delivery control method according to an embodiment of the present invention, as shown below. Figure 1 As shown, this embodiment includes steps 101 to 104, and the specific steps are as follows:

[0065] Step 101: Obtain the auxiliary agent demand time points and auxiliary agent transportation time for several dyeing machines, and generate an arrangement order for several dyeing machines based on the chronological order of the auxiliary agent demand time points.

[0066] Step 101 specifically involves: after obtaining the auxiliary agent demand time points and auxiliary agent transportation time for multiple dyeing machines, comparing the auxiliary agent demand time points for each dyeing machine, and in ascending order, the dyeing machine with the smallest auxiliary agent demand time point is the first machine, and the dyeing machine with the largest auxiliary agent demand time point is the last machine, and so on, to form the order in which multiple dyeing machines are generated.

[0067] In this embodiment, the specific steps for obtaining the auxiliary agent demand time and auxiliary agent transportation time for several dyeing machines are as follows:

[0068] Acquire basic data from several dyeing machines transmitted by the MES system; the basic data includes: process information, dyeing machine auxiliary agent requirement time, required types and quantities;

[0069] Based on the aforementioned basic data, the time points for auxiliary agent demand and the duration of auxiliary agent transportation for several dyeing machines are identified and extracted.

[0070] Step 102: Based on the arrangement order of the dyeing machines, the time point of the auxiliary agent demand, and the transportation time of the auxiliary agent, divide the dyeing machines into several groups of machines with local demand conflicts, and obtain the arrangement order of the several groups of machines with local demand conflicts.

[0071] In this embodiment, the step of dividing the dyeing machines into several locally conflicting groups based on the arrangement order of the dyeing machines, the timing of the auxiliary agent demand, and the duration of the auxiliary agent transportation is specifically as follows:

[0072] Based on the auxiliary agent demand time and auxiliary agent transportation time for each dyeing machine, the delivery completion time for each dyeing machine is obtained.

[0073] Based on the delivery completion time of each dyeing machine and the auxiliary agent demand time of each dyeing machine, and according to the arrangement order of the dyeing machines, determine whether there is a conflict in the auxiliary agent demand between each pair of adjacent dyeing machines.

[0074] If so, the two dyeing machines corresponding to the demand conflict of auxiliary agents will be assigned to the same local demand conflict machine group;

[0075] If not, the two dyeing machines with non-conflicting auxiliary agent requirements will be assigned to different but adjacent local demand conflicting machine groups.

[0076] After determining the auxiliary agent requirements of several dyeing machines, several clusters of machines with local demand conflicts are generated.

[0077] In this embodiment, obtaining the arrangement order of the plurality of local demand conflict machine groups specifically involves: comparing the auxiliary agent demand time points of the first dyeing machine in each local demand conflict machine group with the auxiliary agent demand time points of the plurality of dyeing machines, and obtaining the arrangement order of the plurality of local demand conflict machine groups in chronological order.

[0078] Step 102 specifically involves: after obtaining the arrangement order of multiple dyeing machines, comparing whether the auxiliary agent requirements of two adjacent dyeing machines conflict: if the delivery completion time of the first dyeing machine is before the auxiliary agent requirement time of the second dyeing machine, it indicates that the auxiliary agent requirements of the first and second dyeing machines do not conflict; if the delivery completion time of the first dyeing machine is after the auxiliary agent requirement time of the second dyeing machine, it indicates that the auxiliary agent requirements of the first and second dyeing machines conflict.

[0079] For two dyeing machines with conflicting auxiliary agent demands, they are grouped into the same local demand conflict group. For two dyeing machines with non-conflicting auxiliary agent demands, they are grouped into different but adjacent local demand conflict groups. The two local demand conflict groups are arranged according to the earliest auxiliary agent demand time point in each local demand conflict group. (In the case of four dyeing machines, when the auxiliary agent demands of the first and second dyeing machines conflict, the auxiliary agent demands of the second and third dyeing machines do not conflict, and the auxiliary agent demands of the third and fourth dyeing machines conflict, then the first and second dyeing machines belong to the first local demand conflict group, and the third and fourth dyeing machines belong to the second local demand conflict group. The first local demand conflict group is located before the second local demand conflict group.)

[0080] In a specific embodiment, it is assumed that there are N dyeing machines in the workshop, namely dyeing machine No. 1, dyeing machine No. 2, ..., dyeing machine No. N. When N = 1, there is only one dyeing machine, one set of equipment corresponds to one dyeing machine, and no scheduling is required. In this embodiment, we only consider the case of N ≥ 2.

[0081] Let the time point for the auxiliary agent requirement of staining machine No. N be tg. n Then the time point for the auxiliary agent requirement of dyeing machine No. 1 is tg1, and the time points for the auxiliary agents requirement of dyeing machines No. 1, ..., N are tg1. N Similarly, in this embodiment we only consider the case where n≥2;

[0082] Because the types and quantities of auxiliaries required for each dyeing machine are not exactly the same, as well as the pipeline cleaning time, the auxiliaries transportation time for dyeing machine N is t. n The transport time (including pipeline cleaning time) of the auxiliary agent for dyeing machine No. 1 is t1, ..., and the transport time (including pipeline cleaning time) of the auxiliary agent for dyeing machine No. N is t1. n , n≥2;

[0083] Therefore, the delivery completion time of dyeing machine No. N is tg. N +t n The delivery completion time of dyeing machine No. 1 is tg1+t1.

[0084] In one specific embodiment, when t g1 +t1-t g2 >0 (for example, when n=2, meaning the completion time of dyeing machine 1's delivery is later than the auxiliary agent demand time of dyeing machine 2), it indicates that during the auxiliary agent delivery process of the previous dyeing machine, the next dyeing machine already has an auxiliary agent demand. In this case, there is a situation where the delivery equipment is occupied, requiring intelligent scheduling; t g1 +t1-t g2 If the value is less than 0 (for example, when n=2, meaning the completion time of dyeing machine 1 is earlier than the time when dyeing machine 2 needs auxiliary materials), it indicates that after the auxiliary materials of the previous dyeing machine are delivered, the next dyeing machine does not yet need auxiliary materials. In this case, there is no need for intelligent scheduling, and the materials can be delivered according to the production schedule.

[0085] Step 103: Based on the auxiliary agent transportation time corresponding to the dyeing machine in each of the local demand conflicting machine groups, obtain the scheduling order of the dyeing machines in each of the local demand conflicting machine groups through a preset time optimization algorithm.

[0086] In this embodiment, the step of obtaining the scheduling order of the dyeing machines in each of the local demand-conflicting machine groups based on the auxiliary agent transportation time corresponding to the dyeing machines in each local demand-conflicting machine group, through a preset time optimization algorithm, specifically involves:

[0087] Obtain the number N of coloring machines in each of the local demand conflicting machine clusters, and calculate N! * N coloring machine pre-arrangement orders based on the number N of coloring machines;

[0088] Substituting the pre-arranged order of the dyeing machines and the auxiliary agent transportation time corresponding to the dyeing machines in each of the local demand conflict machine groups into the time optimization algorithm model, the shortest waiting time for each local demand conflict machine group is calculated.

[0089] Select the dyeing machine pre-arrangement order corresponding to the shortest waiting time to obtain the scheduling order of dyeing machines in each of the local demand conflict machine groups.

[0090] In this embodiment, the step of substituting the pre-arranged order of the dyeing machines and the auxiliary agent transport time corresponding to the dyeing machines in each locally conflicting demand group into the time optimization algorithm model to calculate the shortest waiting time in each locally conflicting demand group is as follows:

[0091] The pre-arrangement order of the N! * N dyeing machines and the auxiliary agent transport time t corresponding to the dyeing machines in each local demand conflict group are determined. N Substituting this into the time optimization algorithm model, the waiting time ts corresponding to the coloring machine in each locally conflicting cluster is calculated. N！ ′;

[0092] Compare each waiting time ts N！ The algorithm obtains the shortest waiting time in each cluster of machines with local demand conflicts; wherein the time optimization algorithm model is as follows:

[0093]

[0094] Step 103 specifically involves: In each local demand conflict cluster, multiple dyeing machines are arranged and combined to obtain multiple pre-arrangement orders for dyeing machines. If there are N dyeing machines, there are N! * N pre-arrangement orders for dyeing machines. Substitute these orders into the time optimization algorithm model to calculate the waiting time of each pre-arrangement order for dyeing machines, and select the pre-arrangement order combination with the shortest waiting time as the dyeing machine scheduling order for this local demand conflict cluster. (In the case of 3 dyeing machines in a local demand conflict cluster, the 3 dyeing machines are numbered according to the auxiliary agent demand time point of each dyeing machine: 1, 2, 3. After calculation by the time optimization algorithm, the dyeing machine scheduling order corresponding to the shortest waiting time is determined to be: 2, 3, 1).

[0095] In a specific embodiment, let N = 3, i.e., m = 3. The three dyeing machines simultaneously belong to the same local demand conflict group, with call times and delivery times tg1, tg2, tg3 and delivery times t1, t2, t3, respectively. Based on the delivery order of the auxiliaries required by the three dyeing machines, six scheduling schemes for the delivery order of auxiliaries are determined. N! = 3 * 2 * 1 = 6.

[0096] The overall waiting time for the six scheduling schemes is:

[0097] ts1=t1+(tg1+t1+t2-tg2)+(tg1+t1+t2+t3-tg3)=3t1+2t2+t3+(2tg1-tg2-tg3);

[0098] ts2=t1+(tg1+t1+t3-tg3)+(tg1+t1+t3+t2-tg2)=3t1+t2+2t3+(2tg1-tg2-tg3);

[0099] ts3=(tg1+t2-tg2)+(t2+t1)+(tg1+t2+t1+t2-tg3)=2t1+3t2+t3+(2tg1-tg2-tg3);

[0100] ts4=(tg1+t2-tg2)+(tg1+t2+t3-tg3)+(t2+t3+t1)=t1+3t2+2t3+(2tg1-tg2-tg3);

[0101] ts5=(tg1+t3-tg3)+(t3+t1)+(tg1+t3+t1+t2-tg2)=2t1+t2+3t3+(2tg1-tg2-tg3);

[0102] ts6=(tg1+t3-tg3)+(tg1+t3+t2-tg2)+(t3+t2+t1)=t1+2t2+3t3+(2tg1-tg2-tg3).

[0103] For example, the calling times for dyeing machines 1, 2, and 3 are tg1, tg2, and tg3 (8:00, 8:02, and 8:04), respectively, and the delivery times are t1, t2, and t3 (2 minutes, 3 minutes, and 5 minutes). There are six possible delivery sequences: 1-2-3, 1-3-2, 2-1-3, 2-3-1, 3-1-2, and 3-2-1. Taking the 1-2-3 sequence as an example: ts1 = t1 + (tg1 + t1 + t2 - tg2) + (tg1 + t1 + t2 + t3 - tg3) = 3t1 + 2t2 + t3 + (2tg1 - tg2 - tg3) = 2 + 3 + 6 = 11 minutes. Similarly, ts2, ts3, ts4, ts5, and ts6 can be calculated. The minimum value corresponds to the optimal scheduling scheme (the shortest total waiting time for all 3 machines).

[0104] Step 104: Based on the arrangement order of the several local demand conflict machine groups and the scheduling order of the dyeing machines in each local demand conflict machine group, obtain the auxiliary agent scheduling scheme of the several dyeing machines, and transmit the auxiliary agent scheduling scheme to the delivery equipment so that the delivery equipment performs auxiliary agent delivery based on the auxiliary agent scheduling scheme of the several dyeing machines.

[0105] Step 104 specifically involves: substituting the scheduling order of the dyeing machines in each local demand conflict group into the arrangement order of multiple local demand conflict groups to obtain the auxiliary agent scheduling scheme for the dyeing machines, and sending the auxiliary agent scheduling scheme to the delivery equipment for implementation (in the case of 6 dyeing machines and 2 local demand conflict groups, the 3 dyeing machines are numbered according to the auxiliary agent demand time point of each dyeing machine: 1, 2, 3, 4, 5, 6, and 1, 2, 3 belong to the first local demand conflict group, and 4, 5, 6 belong to the second local demand conflict group; the dyeing machine scheduling order with the shortest waiting time calculated in the first local demand conflict group is 2, 3, 1, and the dyeing machine scheduling order with the shortest waiting time calculated in the second local demand conflict group is 5, 4, 6, then the dyeing machine scheduling order is substituting into the arrangement order of the local demand conflict groups to obtain the auxiliary agent scheduling scheme: 2, 3, 1, 5, 4, 6).

[0106] In a specific embodiment, the following example is used to better illustrate this embodiment:

[0107] The auxiliary agent of the previous dyeing machine is being transported (occupying the transport pipeline), and the next dyeing machine has already started calling. That is, the use of the auxiliary agent transport device by two or more dyeing machines is conflicting, that is, they all need to use it at the same time. This is why we are optimizing the scheduling.

[0108] If the first dyeing machine needs an auxiliary agent at 8:00 and the delivery time is 2 minutes, and the next dyeing machine needs an auxiliary agent at 8:01, then there is a conflict and scheduling is required. If the next dyeing machine needs an auxiliary agent at 8:10, that is, after the previous dyeing machine has completed the delivery, the next dyeing machine has no demand, then delivery can be carried out according to the time sequence, and there is no need to enable the optimization scheduling module.

[0109] The scheduling algorithm determines the conflict between two dyeing machines. The criterion is whether the next dyeing machine has a demand when the previous machine is supplying data. If not, the flow is interrupted; otherwise, the algorithm continues to check the next and subsequent dyeing machines. This iterative process uses breakpoints (e.g., when the third dyeing machine is supplying data and the fourth machine has no demand, the breakpoint is between 3 and 4) as nodes to divide the scheduling of N machines into k local segments (k-1 breakpoints; simply put, one breakpoint leads to optimization in two parts, two breakpoints to optimization in three parts). Since there are conflicts between breakpoints, a scheduling algorithm is used to optimize each segment, and the segments are arranged according to their time sequence. For example, if there are 7 dyeing machines, and the flow between 2 and 3 is interrupted, or between 5 and 6, then the optimization will be for machines 1 and 2, 3, 4, and 5, and finally 6 and 7. The possible results are 21-435-76 (the order of 1 and 2 must be before 3, 4, and 5, and the order of 3, 4, and 5 must be before 6 and 7), and a sequence like 7654321 will not occur, reflecting the overall time-series scheduling approach.

[0110] Accordingly, one embodiment of the present invention also provides a dyeing machine auxiliary agent delivery and control system, including: an intelligent scheduling module 301, an enterprise resource planning system 302, a manufacturing execution system 303, a delivery device 304, and a dyeing machine 305; wherein, the intelligent scheduling module 301 is applied to the dyeing machine auxiliary agent delivery and control method as described in the present invention, the enterprise resource planning system 302 is connected to the manufacturing execution system 303, the manufacturing execution system 303 is connected to the intelligent scheduling module 301, the intelligent scheduling module 301 is connected to the delivery device 304, and the delivery device 304 is connected to the dyeing machine 305.

[0111] In one specific embodiment, for a better illustration of the scheduling process of the dyeing machine auxiliary agent delivery control system, please refer to [link to relevant documentation]. Figure 4The daily production schedule information for the dyeing workshop is issued from the ERP system (Enterprise Resource Planning system) of the textile printing and dyeing enterprise and then reaches the MES system (Manufacturing Execution System). The MES system then issues information such as the process information of each dyeing machine, the time, type, and quantity of dyeing auxiliary materials required, to the intelligent scheduling module. The intelligent scheduling module traverses and optimizes the initial conditions (start time of auxiliary material demand, start time of auxiliary material demand in the next stage), auxiliary material related parameters (time, type, and quantity of auxiliary materials required for each dyeing machine), and optimization algorithm model (the model for minimizing the overall waiting time of auxiliary material delivery for the dyeing machine group) to determine the optimal scheduling scheme for auxiliary material delivery. The intelligent scheduling module then issues the optimal scheduling scheme for auxiliary material delivery to the auxiliary material conveying and distribution equipment (i.e., the distribution equipment mentioned in the abstract). The auxiliary material conveying and distribution equipment delivers the corresponding auxiliary materials to the required dyeing machines according to the scheduling scheme, thereby achieving optimized scheduling of auxiliary material delivery for dyeing machines, improving auxiliary material delivery efficiency, and reducing labor costs.

[0112] This embodiment obtains the auxiliary agent demand time points and auxiliary agent transportation times of multiple dyeing machines, arranges them to obtain a sorting order of several dyeing machines, and generates multiple local demand conflict machine groups. In each local demand conflict machine group, a preset time optimization algorithm is used to obtain the scheduling order of the dyeing machines. Combining the order of the dyeing machines in each local demand conflict machine group with the sorting order of multiple local demand conflict machine groups, an auxiliary agent scheduling scheme for multiple dyeing machines is obtained, enabling the delivery equipment to complete the auxiliary agent transportation and delivery control of the dyeing machines according to the auxiliary agent scheduling scheme. This embodiment divides multiple dyeing machines into local demand conflict machine groups and calculates the sorting of the shortest waiting time of the conflicting machine groups in each local demand conflict machine group. Compared with processing the waiting time of all dyeing machines simultaneously, this embodiment calculates the waiting time of the corresponding dyeing machine in multiple machine groups separately, reducing the amount of data to be processed and improving the control efficiency of auxiliary agent transportation and delivery for dyeing machines.

[0113] Furthermore, in this embodiment, after obtaining multiple local demand conflict machine groups, the scheduling scheme for dyeing machine auxiliary agent distribution is first arranged according to the overall timing of the local demand conflict machine groups, and then arranged according to the local timing of the local demand conflict machine groups. The scheduling scheme for dyeing machine auxiliary agent distribution is selected based on the overall timing concept, thereby improving the accuracy of generating the scheduling scheme for dyeing machine auxiliary agent distribution.

[0114] Example 2

[0115] See Figure 2 , Figure 2 This is a schematic diagram of the structure of a dyeing machine auxiliary agent delivery and control device according to an embodiment of the present invention, including: a data acquisition module 201, a machine group generation module 202, a data generation module 203, and a delivery control module 204;

[0116] The data acquisition module 201 is used to acquire the auxiliary agent demand time points and auxiliary agent transportation time of several dyeing machines, and generate the arrangement order of several dyeing machines based on the chronological order of the auxiliary agent demand time points.

[0117] The machine cluster generation module 202 is used to divide the plurality of dyeing machines into a plurality of locally conflicting machine clusters according to the arrangement order of the plurality of dyeing machines, the time point of the auxiliary agent demand and the transportation time of the auxiliary agent, and to obtain the arrangement order of the plurality of locally conflicting machine clusters.

[0118] The data generation module 203 is used to obtain the scheduling order of the dyeing machines in each of the local demand conflicting machine groups based on the auxiliary agent transportation time corresponding to the dyeing machines in each local demand conflicting machine group through a preset time optimization algorithm.

[0119] The delivery control module 204 is used to obtain an auxiliary agent scheduling scheme for the plurality of dyeing machines according to the arrangement order of the plurality of local demand conflict machine groups and the scheduling order of the dyeing machines in each local demand conflict machine group, and transmit the auxiliary agent scheduling scheme to the delivery equipment so that the delivery equipment performs auxiliary agent delivery based on the auxiliary agent scheduling scheme of the plurality of dyeing machines.

[0120] As an improvement to the above solution, the dyeing machines are divided into several locally conflicting groups based on their arrangement, the timing of auxiliary agent demand, and the duration of auxiliary agent transportation. Specifically:

[0121] Based on the auxiliary agent demand time and auxiliary agent transportation time for each dyeing machine, the delivery completion time for each dyeing machine is obtained.

[0122] Based on the delivery completion time of each dyeing machine and the auxiliary agent demand time of each dyeing machine, and according to the arrangement order of the dyeing machines, determine whether there is a conflict in the auxiliary agent demand between each pair of adjacent dyeing machines.

[0123] If so, the two dyeing machines corresponding to the demand conflict of auxiliary agents will be assigned to the same local demand conflict machine group;

[0124] If not, the two dyeing machines with non-conflicting auxiliary agent requirements will be assigned to different but adjacent local demand conflicting machine groups.

[0125] After determining the auxiliary agent requirements of several dyeing machines, several clusters of machines with local demand conflicts are generated.

[0126] As an improvement to the above solution, the data generation module 203 includes: a data processing unit, a time optimization unit, and a result generation unit;

[0127] The data processing unit is used to obtain the number N of dyeing machines in each of the local demand conflicting machine groups, and calculate N! * N dyeing machine pre-arrangement orders based on the number N of dyeing machines;

[0128] The time optimization unit is used to input the pre-arranged order of the dyeing machines and the auxiliary agent transportation time corresponding to the dyeing machines in each of the local demand conflict machine groups into the time optimization algorithm model to calculate the shortest waiting time for each local demand conflict machine group.

[0129] The result generation unit is used to select the pre-arrangement order of the dyeing machines corresponding to the shortest waiting time, and obtain the scheduling order of the dyeing machines in each of the local demand conflict machine groups.

[0130] As an improvement to the above scheme, the pre-arrangement order of the dyeing machines and the auxiliary agent transportation time corresponding to the dyeing machines in each local demand conflict group are substituted into the time optimization algorithm model to calculate the shortest waiting time in each local demand conflict group. Specifically:

[0131] The pre-arrangement order of the N! * N dyeing machines and the auxiliary agent transport time t corresponding to the dyeing machines in each local demand conflict group are determined. N Substituting this into the time optimization algorithm model, the waiting time ts corresponding to the coloring machine in each locally conflicting cluster is calculated. N！ ′;

[0132] Compare each waiting time ts N！ The algorithm obtains the shortest waiting time in each cluster of machines with local demand conflicts; wherein the time optimization algorithm model is as follows:

[0133]

[0134] As an improvement to the above scheme, obtaining the arrangement order of the plurality of local demand conflict machine groups specifically involves: comparing the auxiliary agent demand time points of the first dyeing machine in each local demand conflict machine group with the auxiliary agent demand time points of the plurality of dyeing machines according to the chronological order, and obtaining the arrangement order of the plurality of local demand conflict machine groups.

[0135] As an improvement to the above solution, the specific steps for obtaining the auxiliary agent requirements and transportation time for several dyeing machines are as follows:

[0136] Acquire basic data from several dyeing machines transmitted by the MES system; the basic data includes: process information, dyeing machine auxiliary agent requirement time, required types and quantities;

[0137] Based on the aforementioned basic data, the time points for auxiliary agent demand and the duration of auxiliary agent transportation for several dyeing machines are identified and extracted.

[0138] This embodiment obtains the auxiliary agent demand time point, auxiliary agent transportation time, and arrangement order of several dyeing machines for each dyeing machine through a data acquisition module. The obtained data is then transmitted to a machine cluster generation module to generate several machine clusters with local demand conflicts and their arrangement orders. The data generation module calculates the scheduling order of the dyeing machines in each local demand conflict machine cluster. The delivery control module combines the scheduling order of the dyeing machines in each local demand conflict machine cluster with the arrangement order of the several local demand conflict machine clusters to generate an auxiliary agent scheduling scheme for several dyeing machines. This scheme is then transmitted to the delivery equipment, thereby completing the control of auxiliary agent delivery for the dyeing machines. This embodiment uses a locally optimal scheduling method to control the auxiliary agent delivery for dyeing machines, improving the production efficiency of the dyeing machines.

[0139] Example 3

[0140] See Figure 5 , Figure 5 This is a schematic diagram of the terminal device structure provided in an embodiment of the present invention.

[0141] One terminal device in this embodiment includes: a processor 501, a memory 502, and a computer program stored in the memory 502 and executable on the processor 501. When the processor 501 executes the computer program, it implements the steps of the various dyeing machine auxiliary agent delivery control methods described in the embodiments, for example... Figure 1 All steps of the dyeing machine auxiliary agent delivery control method shown. Alternatively, when the processor executes the computer program, it implements the functions of each module in the above-described device embodiments, for example: Figure 2 All modules of the dyeing machine auxiliary agent delivery and control device are shown.

[0142] In addition, embodiments of the present invention also provide a computer-readable storage medium, the computer-readable storage medium including a stored computer program, wherein, when the computer program is executed, it controls the device where the computer-readable storage medium is located to perform the dyeing machine auxiliary agent delivery control method as described in any of the above embodiments.

[0143] Those skilled in the art will understand that the schematic diagram is merely an example of a terminal device and does not constitute a limitation on the terminal device. It may include more or fewer components than shown in the diagram, or combine certain components, or different components. For example, the terminal device may also include input / output devices, network access devices, buses, etc.

[0144] The processor 501 may be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor. The processor 501 is the control center of the terminal device, connecting various parts of the terminal device through various interfaces and lines.

[0145] The memory 502 can be used to store the computer programs and / or modules. The processor 501 implements various functions of the terminal device by running or executing the computer programs and / or modules stored in the memory and calling the data stored in the memory 502. The memory 502 may mainly include a program storage area and a data storage area. The program storage area may store the operating system, at least one application program required for a function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the mobile phone (such as audio data, phonebook, etc.). In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as hard disk, memory, plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, at least one disk storage device, flash memory device, or other volatile solid-state storage device.

[0146] Wherein, if the modules / units integrated in the terminal device are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, all or part of the processes in the methods of the above embodiments of the present invention can also be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium, and when the computer program is executed by a processor, it can implement the steps of the various method embodiments described above. Wherein, the computer program includes computer program code, which can be in the form of source code, object code, executable file, or some intermediate form, etc. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, portable hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signal, telecommunication signal, and software distribution medium, etc.

[0147] It should be noted that the device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Furthermore, in the accompanying drawings of the device embodiments provided by this invention, the connection relationships between modules indicate that they have communication connections, which can be specifically implemented as one or more communication buses or signal lines. Those skilled in the art can understand and implement this without any creative effort.

[0148] The above description represents the preferred embodiments of the present invention. It should be noted that those skilled in the art can make various improvements and modifications without departing from the principles of the present invention, and these improvements and modifications are also considered to be within the scope of protection of the present invention.

Claims

1. A method for controlling the delivery and distribution of dyeing machine auxiliaries, characterized in that, include: Obtain the auxiliary agent demand time points and auxiliary agent transportation time for several dyeing machines, and generate an arrangement order for several dyeing machines based on the chronological order of the auxiliary agent demand time points; Based on the arrangement order of the dyeing machines, the time point of the auxiliary agent demand, and the transportation time of the auxiliary agent, the dyeing machines are divided into several groups of machines with local demand conflicts, and the arrangement order of the several groups of machines with local demand conflicts is obtained. Based on the auxiliary agent transport time corresponding to the dyeing machines in each of the local demand conflicting machine groups, a preset time optimization algorithm is used to obtain the scheduling order of the dyeing machines in each of the local demand conflicting machine groups; wherein, the step of obtaining the scheduling order of the dyeing machines in each of the local demand conflicting machine groups based on the auxiliary agent transport time corresponding to the dyeing machines in each of the local demand conflicting machine groups specifically involves: obtaining the number N of dyeing machines in each of the local demand conflicting machine groups; calculating N!*N pre-arrangement orders of dyeing machines based on the number N of dyeing machines; and combining the pre-arrangement orders of dyeing machines with the scheduling order of dyeing machines in each of the local demand conflicting machine groups. The auxiliary agent transport time corresponding to the dyeing machine is substituted into the time optimization algorithm model to calculate the shortest waiting time for each local demand conflict machine group; the pre-arrangement order of the dyeing machines corresponding to the shortest waiting time is selected to obtain the scheduling order of the dyeing machines in each local demand conflict machine group; the step of substituting the pre-arrangement order of the dyeing machines and the auxiliary agent transport time corresponding to the dyeing machines in each local demand conflict machine group into the time optimization algorithm model to calculate the shortest waiting time in each local demand conflict machine group is specifically: substituting the pre-arrangement order of the N!*N dyeing machines and the auxiliary agent transport time t corresponding to the dyeing machines in each local demand conflict machine group into the time optimization algorithm model to calculate the shortest waiting time in each local demand conflict machine group. N Substituting this into the time optimization algorithm model, the waiting time corresponding to the coloring machine in each local demand conflict cluster is calculated. Compare each waiting time. The shortest waiting time is obtained in each cluster of machines with local demand conflicts; wherein the time optimization algorithm model is as follows: = * ； Based on the arrangement order of several local demand conflict machine groups and the scheduling order of dyeing machines in each local demand conflict machine group, an auxiliary agent scheduling scheme for several dyeing machines is obtained, and the auxiliary agent scheduling scheme is transmitted to the delivery equipment so that the delivery equipment can perform auxiliary agent delivery based on the auxiliary agent scheduling scheme for several dyeing machines.

2. The dyeing machine auxiliary agent delivery and control method according to claim 1, characterized in that, The dyeing machines are divided into several groups with local demand conflicts based on their arrangement, the timing of auxiliary agent demand, and the duration of auxiliary agent transportation. Specifically: Based on the auxiliary agent demand time and auxiliary agent transportation time for each dyeing machine, the delivery completion time for each dyeing machine is obtained. Based on the delivery completion time of each dyeing machine and the auxiliary agent demand time of each dyeing machine, and according to the arrangement order of the dyeing machines, determine whether there is a conflict in the auxiliary agent demand between each pair of adjacent dyeing machines. If so, the two dyeing machines corresponding to the demand conflict of auxiliary agents will be assigned to the same local demand conflict machine group; If not, the two dyeing machines with non-conflicting auxiliary agent requirements will be assigned to different but adjacent local demand conflicting machine groups. After determining the auxiliary agent requirements of several dyeing machines, several clusters of machines with local demand conflicts are generated.

3. The dyeing machine auxiliary agent delivery and control method according to claim 1, characterized in that, The specific steps for obtaining the order of the several local demand conflict machine groups are as follows: based on the auxiliary agent demand time points of several dyeing machines, compare the auxiliary agent demand time points of the first dyeing machine in each local demand conflict machine group, and obtain the order of the several local demand conflict machine groups according to the chronological order.

4. The dyeing machine auxiliary agent delivery and control method according to claim 1, characterized in that, The specific steps for obtaining the auxiliary agent requirements and transportation time for several dyeing machines are as follows: Acquire basic data from several dyeing machines transmitted by the MES system; the basic data includes: process information, dyeing machine auxiliary agent requirement time, required types and quantities; Based on the aforementioned basic data, the time points for auxiliary agent demand and the duration of auxiliary agent transportation for several dyeing machines are identified and extracted.

5. A dyeing machine auxiliary agent delivery and control device, characterized in that, include: Data acquisition module, fleet generation module, data generation module, and delivery control module; The data acquisition module is used to acquire the auxiliary agent demand time points and auxiliary agent transportation time of several dyeing machines, and generate an arrangement order of several dyeing machines based on the chronological order of the auxiliary agent demand time points. The cluster generation module is used to divide the dyeing machines into several clusters with local demand conflicts based on the arrangement order of the dyeing machines, the time point of the auxiliary agent demand, and the transportation time of the auxiliary agent, and to obtain the arrangement order of the several clusters with local demand conflicts. The data generation module is used to obtain the scheduling order of the dyeing machines in each of the local demand conflicting machine groups based on the auxiliary agent transportation time corresponding to the dyeing machines in each local demand conflicting machine group, using a preset time optimization algorithm; wherein, the step of obtaining the scheduling order of the dyeing machines in each of the local demand conflicting machine groups based on the auxiliary agent transportation time corresponding to the dyeing machines in each local demand conflicting machine group specifically involves: obtaining the number N of dyeing machines in each local demand conflicting machine group; calculating N!*N pre-arrangement orders of dyeing machines based on the number N; and combining the pre-arrangement orders of dyeing machines with each local demand conflicting machine group. The auxiliary agent transport time corresponding to the dyeing machine in the conflicting machine group is substituted into the time optimization algorithm model to calculate the shortest waiting time for each local demand conflicting machine group; the pre-arrangement order of the dyeing machines corresponding to the shortest waiting time is selected to obtain the scheduling order of the dyeing machines in each of the local demand conflicting machine groups; the step of substituting the pre-arrangement order of the dyeing machines and the auxiliary agent transport time corresponding to the dyeing machines in each local demand conflicting machine group into the time optimization algorithm model to calculate the shortest waiting time in each local demand conflicting machine group is specifically as follows: the pre-arrangement order of the N!*N dyeing machines and the auxiliary agent transport time t corresponding to the dyeing machines in each local demand conflicting machine group are substituted into the time optimization algorithm model to calculate the shortest waiting time in each local demand conflicting machine group. N Substituting this into the time optimization algorithm model, the waiting time corresponding to the coloring machine in each local demand conflict cluster is calculated. Compare each waiting time. The shortest waiting time is obtained in each cluster of machines with local demand conflicts; wherein the time optimization algorithm model is as follows: = * ； The delivery control module is used to obtain an auxiliary agent scheduling scheme for the dyeing machines based on the arrangement order of the several local demand conflict machine groups and the scheduling order of the dyeing machines in each local demand conflict machine group, and transmit the auxiliary agent scheduling scheme to the delivery equipment so that the delivery equipment can perform auxiliary agent delivery based on the auxiliary agent scheduling scheme of the several dyeing machines.

6. A dyeing machine auxiliary agent delivery and control system, characterized in that, include: The system comprises an intelligent scheduling module, an enterprise resource planning system, a manufacturing execution system, a distribution device, and a dyeing machine; wherein the intelligent scheduling module is applied to the dyeing machine auxiliary agent delivery control method as described in any one of claims 1 to 4, the enterprise resource planning system is connected to the manufacturing execution system, the manufacturing execution system is connected to the intelligent scheduling module, the intelligent scheduling module is connected to the distribution device, and the distribution device is connected to the dyeing machine.

7. A computer terminal device, characterized in that, The device includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor, when executing the computer program, implements a dyeing machine auxiliary agent delivery control method as described in any one of claims 1 to 4.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored computer program, wherein, when the computer program is executed, it controls the device on which the computer-readable storage medium is located to perform a dyeing machine auxiliary agent delivery control method as described in any one of claims 1 to 4.

Images