CN108255141A - A kind of assembling schedule information generating method and system - Google Patents

Abstract

The present invention provides a method and system for generating assembly scheduling information, wherein the method includes: obtaining a plurality of product queues, wherein each product queue is used to represent the product sequence of n products entering the assembly process; according to the preset scheduling rules and the product queue, to obtain the total assembly time for all products in each product queue to complete the assembly, wherein the preset scheduling rules include the product selection strategy for multiple assembly teams in the same process, the product sorting strategy and assembly Parameters; determine the target product queue with the shortest total assembly time, generate and output assembly scheduling information, the assembly scheduling information includes the product order of the n products entering the assembly process represented by the target product queue. The assembly scheduling information generation method and system provided by the embodiments of the present invention can improve the assembly efficiency of the workshop when applying the assembly scheduling information, and shorten the total assembly time of the workshop.

Description

A method and system for generating assembly scheduling information

technical field

The invention relates to the technical field of product assembly, in particular to a method and system for generating assembly scheduling information.

Background technique

Complex products refer to products with complex customer needs, complex product composition, complex product technology, complex manufacturing process, and complex project management, such as missiles, satellites, rockets, and aircraft. Among them, assembly is the last link in the production of complex products, and it is also one of the most important links. The result is directly related to the quality, life, performance, reliability and maintainability of the product.

Production scheduling is a key link in the product assembly process and one of the core issues in the management and control of the assembly process. It refers to allocating limited resources to several tasks in time under certain constraints to meet or optimize a or multiple performance indicators. The time spent on each process on the path with the longest working hours in the assembly process directly affects the assembly completion time of the product. Each process may be completed by multiple time-consuming and unrelated assembly teams. Due to the complex product assembly Relevant constraints such as complex layers, many resources involved, and long time periods make it difficult to optimize production scheduling.

In the prior art, a simple workflow is used for the assembly of complex products, and the product processing sequence is fixed, so there is a problem that the assembly time of complex products is long.

Contents of the invention

Embodiments of the present invention provide a method and system for generating assembly scheduling information to solve the problem of long assembly time of existing complex products.

In a first aspect, an embodiment of the present invention provides a method for generating assembly scheduling information, the method including:

Obtain multiple product queues, wherein each product queue is used to represent the product sequence of n products entering the assembly process, different product queues indicate that the product sequences of the n products are different, and the n is an integer greater than or equal to 2 ;

According to the preset scheduling rules and the product queues, the total assembly time for all products in each product queue to complete the assembly is obtained, wherein the preset scheduling rules include the selection strategy of the product for multiple assembly teams in the same process, the product The sorting strategy and assembly parameters of ;

Determine the target product queue with the shortest total assembly time, generate and output assembly scheduling information, where the assembly scheduling information includes the order of the n products entering the assembly process indicated by the target product queue.

Optionally, the step of determining the target product queue with the shortest total assembly time, and generating and outputting assembly scheduling information includes:

Determining the first product queue with the shortest total assembly time in the product queue;

Perform an insertion operation on the first product queue to obtain a second product queue, and perform a mixed neighborhood local search operation on the second product queue according to the preset scheduling rule, and filter out products based on the second product queue The third product queue with the shortest total assembly time;

If the total assembly duration of the third product queue is less than the total assembly duration of the first product queue, update the target product queue to the third product queue, generate and output assembly scheduling information, and the assembly scheduling The information includes the product order of the n products entering the assembly process represented by the updated target product queue.

Optionally, performing an insert operation on the first product queue to obtain a second product queue, and performing a mixed neighborhood local search operation on the second product queue according to the preset scheduling rule, and filtering out Describe the steps of the third product queue with the shortest total assembly time of the second product queue, including:

Perform an insert operation on the first product queue to obtain a second product queue, and obtain the total assembly time of the second product queue according to the preset scheduling rule and the second product queue;

performing an insert operation or an exchange operation on the second product queue to obtain a fourth product queue, and obtaining the total assembly time of the fourth product queue according to the preset scheduling rule and the fourth product queue;

If the total assembly time of the fourth product queue is less than the total assembly time of the second product queue, update the second product queue to the fourth product queue, add 1 to the first iteration number, and execute the Performing an insert operation or an exchange operation on the second product queue to obtain a fourth product queue, and obtaining the total assembly time of the fourth product queue according to the preset scheduling rule and the fourth product queue;

If the total assembly time of the fourth product queue is not less than the total assembly time of the second product queue, then add 1 to the first iteration number, and perform the insertion or exchange operation on the second product queue, Obtaining the fourth product queue, and obtaining the total assembly time of the fourth product queue according to the preset scheduling rules and the fourth product queue;

When the first iteration number is not less than the first preset iteration number, the second product queue is used as the third product queue.

Optionally, the step of acquiring multiple product queues includes:

Get multiple product queues of the current iteration round;

After the step of obtaining the total assembly time of all products in each product queue according to the preset scheduling rule and the product queue, it also includes:

Determine the fifth product queue with the shortest total assembly time in the current iteration round, and add 1 to the second iteration number;

If the total assembly time of the fifth product queue is less than the sixth product queue with the shortest total assembly time in completed iterations, update the sixth product queue to the fifth product queue, and update the sixth product queue The algebra has not been updated to perform a clearing operation;

If the total assembly time of the fifth product queue is not less than the total assembly time of the sixth product queue, add 1 to the unupdated generation number of the sixth product queue;

If the number of unupdated generations of the sixth product queue is not less than the preset threshold value, a new product queue is obtained, and the new product queue is replaced by a product with a preset proportion of the total assembly time in the current iteration round After queuing, execute the step of obtaining the total assembly time of each product according to the preset scheduling rules and the replaced product queue;

If the number of unupdated generations of the sixth product queue is less than the preset threshold value, and the second iteration number is less than the second preset iteration number, then perform the step of acquiring multiple product queues of the next iteration round;

The step of determining the target product queue with the shortest total assembly time includes:

The sixth product queue is used as the target product queue.

Optionally, the step of acquiring multiple product queues includes:

generating a plurality of time pairs, each time pair comprising a number of time points equal to the number of products;

Multiple product queues corresponding to the multiple time pairs are determined according to the mapping relationship between the sequence of time points and the sequence of product numbers.

Optionally, each selection strategy includes:

For each process in the assembly process, determine the earliest allowable processing time of the product in this process and the assembly time of each assembly team in this process; according to the earliest allowable processing time and the assembly time of each assembly team in this process, Computing multiple completion time points when the product is assembled by multiple assembly teams; selecting the first assembly team with the earliest completion time point to assemble the product.

Optionally, each selection strategy also includes:

If there are multiple first assembly teams, select the second assembly team with the shortest assembly time in the process among the first assembly teams to assemble the product.

Optionally, for each selection strategy, also include:

If there are multiple second assembly teams, then determine the release time of multiple second assembly teams; calculate the difference between the earliest allowable processing time point of the product and the release time of multiple second assembly teams in the process value, select the third assembly team with the smallest difference to assemble the product.

Optionally, each sorting strategy includes:

The processing order of each product in the first process is determined according to the product queue, and the other processes except the first process are sequentially processed according to the time sequence when the products are in place.

In the second aspect, the embodiment of the present invention also provides an assembly scheduling information generation system, including:

The first acquisition module is used to acquire multiple product queues, wherein each product queue is used to represent the product sequence of n products entering the assembly process, and different product queues indicate that the product sequences of the n products are different, and the n is an integer greater than or equal to 2;

The second acquisition module is used to obtain the total assembly time of all products in each product queue according to the preset scheduling rule and the product queue, wherein the preset scheduling rule includes that the product performs multiple assembly tasks in the same process. The selection strategy of the assembly team, the sequencing strategy of the products and the assembly parameters;

The output module is configured to determine the target product queue with the shortest total assembly time, generate and output assembly scheduling information, and the assembly scheduling information includes the order of the n products entering the assembly process indicated by the target product queue.

Optionally, the output module includes:

The first determining submodule is used to determine the first product queue with the shortest total assembly time in the product queue;

The screening sub-module is used to perform an insert operation on the first product queue to obtain a second product queue, and perform a mixed neighborhood local search operation on the second product queue according to the preset scheduling rules, and filter out products based on the The third product queue with the shortest total assembly time of the second product queue;

An output submodule, configured to update the target product queue to the third product queue if the total assembly time of the third product queue is less than the total assembly time of the first product queue, and generate and output an assembly schedule Information, the assembly scheduling information includes the product order of the n products entering the assembly process represented by the updated target product queue.

Optionally, the screening submodule includes:

The first obtaining unit is configured to perform an insert operation on the first product queue to obtain a second product queue, and obtain the general assembly of the second product queue according to the preset scheduling rule and the second product queue duration;

The second obtaining unit is configured to perform an insert operation or an exchange operation on the second product queue to obtain a fourth product queue, and obtain the fourth product queue according to the preset scheduling rule and the fourth product queue. total assembly time;

The first counting unit is used to update the second product queue to the fourth product queue if the total assembly time of the fourth product queue is less than the total assembly time of the second product queue, and count the first iteration times Add 1, and perform the insert operation or exchange operation on the second product queue to obtain a fourth product queue, and obtain the fourth product queue according to the preset scheduling rule and the fourth product queue The steps of the total assembly time;

The second counting unit is used to add 1 to the first iteration number if the total assembly duration of the fourth product queue is not less than the total assembly duration of the second product queue, and execute the pairing of the second product queue. performing an insert operation or an exchange operation to obtain a fourth product queue, and obtaining the total assembly time of the fourth product queue according to the preset scheduling rule and the fourth product queue;

A determining unit, configured to use the second product queue as a third product queue when the first iteration count is not less than a first preset iteration count.

Optionally, the obtaining unit is used to obtain multiple product queues of the current iteration round;

The assembly scheduling information generation system also includes:

A determining module, configured to determine the fifth product queue with the shortest total assembly time in the current iteration round, and add 1 to the second iteration number;

The first counting module is used to update the sixth product queue to the fifth product queue if the total assembly time of the fifth product queue is less than the sixth product queue with the shortest total assembly time in the number of completed iterations , and clear the unupdated algebra of the sixth product queue;

The second counting module is used to add 1 to the unupdated generation number of the sixth product queue if the total assembly time of the fifth product queue is not less than the total assembly time of the sixth product queue;

The first execution module is used to acquire a new product queue and replace the new product queue with the preset proportion of the total After assembling the product queue with a long duration, execute the step of obtaining the total assembly duration of each product according to the preset scheduling rule and the replaced product queue;

The second execution module is configured to execute obtaining a plurality of the next iteration round if the number of unupdated generations of the sixth product queue is less than the preset threshold value and the second iteration number is smaller than the second preset iteration number. The steps of the product queue;

The output module is configured to use the sixth product queue as the target product queue.

Optionally, the acquisition module includes:

generating submodules for generating a plurality of time pairs, each time pair comprising a plurality of time points equal to the number of the plurality of products;

The second determination sub-module is configured to determine a plurality of product queues corresponding to the plurality of time pairs according to the mapping relationship between the sequence of time points and the sequence of product numbers.

Optionally, the second acquisition module is used for each process in the assembly process to determine the earliest allowable processing time of the product in the process and the assembly time of each assembly team in the process; according to the earliest allowable processing time Point and the assembly time of each assembly team in this process, calculate the multiple completion time points when the product is assembled by multiple assembly teams; select the first assembly team with the earliest completion time point to assemble the product.

Optionally, the second acquisition module is also used for selecting the second assembly team with the shortest assembly time in the process among the first assembly teams to assemble the product if there are multiple first assembly teams.

Optionally, the second acquisition module is also used to determine the release time of multiple second assembly teams if there are multiple second assembly teams; The difference between the release times of multiple second assembly teams is selected, and the third assembly team with the smallest difference is selected to assemble the product.

Optionally, the second acquisition module is configured to determine the processing order of each product in the first process according to the product queue, and the other processes except the first process are sequentially processed according to the time sequence of the products arriving.

In the third aspect, the embodiment of the present invention also provides an electronic device, including: a processor, a memory, and a computer program stored on the memory and operable on the processor, and the computer program is executed by the processor During execution, the steps of the method for generating assembly scheduling information as described above are realized.

In the fourth aspect, the embodiment of the present invention also provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the method for generating assembly scheduling information as described above is realized A step of.

In the embodiment of the present invention, by obtaining multiple product queues, each product queue is used to represent the product sequence of n products entering the assembly process, and different product queues indicate that the product sequences of the n products are different. n is an integer greater than or equal to 2; according to the preset scheduling rule and the product queue, the total assembly time for all products in each product queue to complete the assembly is obtained, wherein the preset scheduling rule includes that the product is assembled in the same process Multiple assembly team selection strategies, product sorting strategies, and assembly parameters; determine the target product queue with the shortest total assembly time, generate and output assembly scheduling information, and the assembly scheduling information includes the n items represented by the target product queue The product sequence in which products enter the assembly process. In this way, it is possible to determine the product sequence of the n products with the shortest total assembly time entering the assembly process from a large number of product queues, improve the assembly efficiency of the workshop when applying assembly scheduling information, and shorten the total assembly time of the workshop.

Description of drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following will briefly introduce the accompanying drawings that need to be used in the description of the embodiments of the present invention. Obviously, the accompanying drawings in the following description are only some embodiments of the present invention. For those skilled in the art, other drawings can also be obtained based on these drawings without any creative effort.

FIG. 1 is a schematic flowchart of a method for generating assembly scheduling information provided by an embodiment of the present invention;

Figure 2 is a simplified diagram of the path with the longest man-hours in the complex product assembly process;

FIG. 3 is a schematic flowchart of a method for generating assembly scheduling information provided by another embodiment of the present invention;

FIG. 4 is a schematic flowchart of a method for generating assembly scheduling information provided by another embodiment of the present invention;

Fig. 5 is a performance diagram of the method for generating assembly scheduling information provided by another embodiment of the present invention under different levels of assembly parameters;

Fig. 6 is the test result obtained according to Table 1 by the assembly scheduling information generation method provided by another embodiment of the present invention;

Fig. 7 is a result diagram of the total assembly duration of the assembly scheduling information generation method of each embodiment of the present invention;

Fig. 8 is a graph of average value, optimal value and standard deviation of assembly scheduling information generation methods of various embodiments of the present invention;

FIG. 9 is a schematic structural diagram of an assembly scheduling information generation system provided by an embodiment of the present invention;

Fig. 10 is a schematic structural diagram of an assembly scheduling information generation system provided by another embodiment of the present invention;

Fig. 11 is a schematic structural diagram of an assembly scheduling information generation system provided by another embodiment of the present invention;

Fig. 12 is a schematic structural diagram of an assembly scheduling information generation system provided by another embodiment of the present invention;

Fig. 13 is a schematic structural diagram of an assembly scheduling information generation system provided by another embodiment of the present invention;

FIG. 14 is a schematic diagram of a hardware structure of an electronic device implementing various embodiments of the present invention.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are some of the embodiments of the present invention, but not all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

Please refer to FIG. 1 . FIG. 1 is a schematic flowchart of a method for generating assembly scheduling information provided by an embodiment of the present invention. As shown in Figure 1, including:

Step 101: Obtain multiple product queues, wherein each product queue is used to represent the product sequence of n products entering the assembly process, different product queues indicate that the product sequences of the n products are different, and the N is greater than or equal to Integer of 2.

Please refer to Figure 2, which is a simplified diagram of the path with the longest man-hours in the complex product assembly process. The procedures in the embodiments of the present invention are all procedures on the path with the longest man-hours in the workshop production line, and the products are all assembled on the path with the longest man-hours. The products can be the same product or the same assembly process. For similar products, the order and quantity of products undergoing assembly processes are the same, and multiple assembly teams on each assembly process can assemble each product.

In this embodiment, a mixed integer linear programming model is established based on the Krill Herd algorithm (Krill Herd, referred to as KH), specifically including:

m in Z = C _max (1)

Among them: j, g, h are product numbers, J={1,2,...,n}, _n is the total number of products;

S={1,2,...,s}, _s is the total number of processes; k is the process number, k∈S;

M ^(k) is the number of parallel assembly teams on process k;

p _jkm is the time required for product j to be assembled in process k by assembly team m;

t _jk is the starting time of the kth process of product j;

C _max is the maximum completion time;

U is a preset positive number;

Z is the entire construction period;

x _{j, k, m} = 1, the kth process of product j is assigned to assembly team m; otherwise x _{j, k, m} = 0;

y _{j, k, t} = 1, the kth process of product j is assembled at time t; otherwise, y _{j, k, t} = 0;

z _g,h,k =1, product g is assembled before product h at the kth process; otherwise z _g,h,k =0.

In the above model, formula (1) means to select the minimum construction period; formula (2) means that the completion time of the last product in the last process _s is C _max ; formula (3) means that the same product can only be completed after the previous process is assembled. Start the next process; Equation (4) indicates that each product can only be assembled by one assembly team at each process stage; Equation (5) indicates that there are three sequential relationships between products _g and _h : before, after, and at the same time ; Equation (6) indicates that the same assembly team can only assemble one product at a time, that is, the assembly of the next product can only start after the previous product is assembled; Equation (7) and Equation (8) indicate that the value of the variable is Non-negative number, 0 or 1.

For example, if the total number of processes on the path with the longest working hours in the workshop production line is s, then n products need to go through s processes in the same order, among which, there are m assembly teams in each process that can process n products for assembly.

Each product queue includes product numbers of n products, and each product enters the assembly process successively according to the arrangement sequence in the product queue. For example: n=5, the product queue is (5, 2, 4, 3, 1), then enter the assembly process in sequence according to the order of product 5, product 2, product 4, product 3 and product 1.

Step 102: Obtain the total assembly time of all products in each product queue according to the preset scheduling rule and the product queue, wherein the preset scheduling rule includes the selection of multiple assembly teams for the product in the same process Strategies, sequencing strategies for products, and assembly parameters.

In the embodiment of the present invention, at zero time, all products are in a state that can be installed; each product can only enter the next process after the previous process is completed; each product can only be carried out by one assembly team at the same time Assembly; the product is not allowed to be interrupted during the assembly from the assembly team to the end of the assembly; there is a buffer zone with unlimited capacity between adjacent processes; the time required for the product to be assembled by the assembly team in the process is known; the product is assembled in the assembly team The preparation time in advance belongs to the time required for the product to be assembled by the assembly team in the process.

Among them, when there are multiple assembly teams in one process for assembly, each assembly team has different personnel, assembly machines and products, and the time required for different assembly teams in one process to complete assembly is not related to each other.

By knowing how many processes the product needs to go through and the assembly time required for each process product assembly, the time for each product to complete the assembly can be calculated. Combined with the product queue, the total number of products can be known, so that the total assembly time of all products in each product queue can be calculated.

First of all, the total assembly time is related to the assembly team selected for each process of the product.

Optionally, in a feasible implementation manner, the selection strategy of the product for multiple assembly teams in the same process includes: for each process in the assembly process, determine the earliest allowable processing time point a _m of the product in this process and the assembly time of each assembly team in this process p _jkm , where a _m =max(rm,C _j,k-1 ), _rm represents the release time of the machine, and C _j,k-1 represents that the workpiece j was in the last The completion time of the stage; according to the earliest allowable processing time point a _m and the assembly time p _jkm of each assembly team in this process, calculate the multiple completion time points a _m +p _jkm of the product assembled by multiple assembly teams; select The first assembly team with the earliest completion time point assembles the product.

By selecting the first assembly team that can reach the earliest completion time point to assemble the product, so that each product can finish the assembly of the process at the earliest completion time in each process, thereby shortening the total assembly time of the product queue.

Further, since the assembly durations of multiple assembly teams are not related to each other, there may be a situation where there are multiple first assembly teams. In this case, optionally, in this embodiment, if there are many , then select the second assembly team with the shortest assembly time p _jkm in the process among the first assembly teams to assemble the product.

If there are multiple first assembly teams with the same completion time point in the same process, select the second assembly team with the shortest assembly time to assemble the product, so as to improve the assembly speed of the product when the completion time is determined, and also improve Product scheduling flexibility.

In addition, when there are multiple first assembly teams, the first assembly team with the shortest delivery path may be selected for assembly, or a specific first assembly team may be selected for assembly, which is not limited in this embodiment.

Further, since the assembly durations of multiple assembly teams are not related to each other, there may be a situation where there are multiple second assembly teams. In this case, optionally, in this embodiment, if there are many , then determine the release times r _m of multiple second assembly teams; calculate the difference between the earliest allowable processing time point a _m of the product in this process and the release times of multiple second assembly teams a _m -r _m , select the third assembly team with the smallest difference a _m -r _m to assemble the product.

The release time of the assembly crew is the time used to compensate for individual needs, inevitable delays, and reduced performance due to fatigue. The release time includes a series of unavoidable time for assembly employees to drink water, go to the toilet, wipe sweat, replace assembly machines, maintain assembly machines, and so on. Select the third assembly team with the smallest difference between the earliest allowable processing time point of the product in this process and the release time of multiple second assembly teams, and the completion time point is the same as the earliest allowable processing time point of the product in this process In the case of , the longer the release time of the third assembly team indicates that the third assembly team has the highest assembly efficiency, and because of the variability of the release time, the actual release time is often lower than the release time used in the calculation. In this case There is a possibility that the completion time of the next product being assembled by the third assembly team may be advanced.

By selecting the third assembly team with the smallest difference between the earliest allowable processing time point of the process and the release time of multiple second assembly teams among the plurality of second assembly teams to assemble the product, When the actual release time is lower than the release time used for calculation, the final actual completion time point can be made ahead of the calculated completion time point, thereby shortening the total assembly time of the product queue.

In addition, if there are multiple second assembly teams, the second assembly team with the shortest delivery path may be selected for assembly, or a specific second assembly team may be selected for assembly, which is not limited in this embodiment.

It should be noted that, in other implementations of the embodiment of the present invention, the selection of multiple assembly teams for the product in the same process may also be selecting a specific assembly team from among the multiple assembly teams in the process to assemble the product , it is also possible to sequentially select the assembly team to assemble the product according to the order of the assembly team's completion time of the previous product, which is not limited in this embodiment.

Secondly, the total assembly time is also related to the product sequencing strategy.

Optionally, in another feasible implementation manner, the ordering strategy of products in each process includes: determining the processing order of each product in the first process according to the product queue, The process is assembled sequentially according to the chronological order of the products in place.

The sequence of processes experienced by the product is the same, that is, the first process, the second process, ..., the s-1th process and the sth process are sequentially experienced. The order of products entering the first process is entered in order according to the sorting order of the product queue, and other processes after the first process process the products in sequence according to the time sequence of the products arriving at the process.

Furthermore, the product can only enter the second process after the first process is completed, but because there are multiple assembly teams in the first process, the first product can be assembled by one assembly team in the first process, and the second product can Enter the first process and be assembled by other assembly teams. In this case, since the assembly time of different products in different assembly teams is different, multiple products may arrive at a process at the same time. Optionally, in this embodiment, if the first product with the same arrival time has If there are more than one, then determine the assembly time of the first product in this process; the second product with the shortest assembly time in this process is preferentially assembled.

By prioritizing the assembly of the second product with the shortest assembly time in the process, the second product can enter the subsequent process earlier, thereby improving the flexibility of the product in the assembly process, and also preventing the subsequent process from being affected by the previous process. The process takes too long to cause idle conditions, so as to avoid reducing the resource utilization rate of subsequent processes.

In addition, when multiple products arrive at a process at the same time, specific products may be assembled preferentially, or specific products may be assembled in a delayed manner, which is not limited in this embodiment.

It should be noted that, in other implementations of the embodiment of the present invention, if there are multiple first products with the same arrival time point, specific products can also be assembled preferentially, or can be assembled according to the needs of subsequent processes of the products. Time priority is used to assemble products that require a long time for subsequent processes, which is not limited in this embodiment of the present invention.

In addition, the total assembly time is also related to assembly parameters such as control interval time and total number of product queues.

The control interval time of n products in the product queue entering the assembly process and the total number of product queues directly affect the total assembly time of the product queue. Take the control interval time as an example to illustrate: the control interval time is too short, which may cause the product to be in the s process The front part of the process is too congested, causing the latter part of the process to be idle, reducing the resource utilization rate of the latter part of the assembly process, thereby prolonging the total assembly time of the product queue; or, the control interval is too long, which may cause the s to process The overall load does not reach saturation, thereby reducing the resource utilization rate of the overall assembly process, thereby prolonging the total assembly time of the product queue.

Through the above selection strategy, sorting strategy, assembly parameters, total number of processes s, total number of products n, and the known time required for different products in different assembly teams, the total assembly time for all products in each product queue to complete assembly can be calculated .

Step 103: Determine the target product queue with the shortest total assembly time, generate and output assembly scheduling information, the assembly scheduling information includes the order of the n products entering the assembly process indicated by the target product queue.

After obtaining the total assembly time of all product queues, select the target product queue with the shortest total assembly time, and generate assembly scheduling information including the order of the n products entering the assembly process represented by the target product queue. The specific form of assembly scheduling information can be process execution schedule, resource scheduling schedule, etc. It should be considered that any assembly scheduling information that can reflect the order of n products entering the assembly process belongs to the protection scope of the embodiments of the present invention.

By outputting the assembly scheduling information including the product sequence of the n products entering the assembly process represented by the target product queue, the assembly workshop manager can apply the assembly scheduling information to the assembly workshop, thereby shortening the total assembly time of the assembly workshop .

In the embodiment of the present invention, by obtaining multiple product queues, each product queue is used to represent the product sequence of n products entering the assembly process, and different product queues indicate that the product sequences of the n products are different. n is an integer greater than or equal to 2; according to the preset scheduling rule and the product queue, the total assembly time for all products in each product queue to complete the assembly is obtained, wherein the preset scheduling rule includes that the product is assembled in the same process Multiple assembly team selection strategies, product sorting strategies, and assembly parameters; determine the target product queue with the shortest total assembly time, generate and output assembly scheduling information, and the assembly scheduling information includes the n items represented by the target product queue The product sequence in which products enter the assembly process. In this way, it is possible to determine the product sequence of the n products with the shortest total assembly time entering the assembly process from a large number of product queues, improve the assembly efficiency of the workshop when applying assembly scheduling information, and shorten the total assembly time of the workshop.

Please refer to FIG. 3 . FIG. 3 is a schematic flowchart of a method for generating assembly scheduling information provided by another embodiment of the present invention. As shown in Figure 3, it includes the following steps:

Step 301: Obtain multiple product queues, wherein each product queue is used to represent the product sequence of n products entering the assembly process, different product queues indicate that the product sequences of the n products are different, and the n is greater than or equal to Integer of 2.

In a feasible implementation manner, step 301 specifically includes:

generating a plurality of time pairs, each time pair comprising a number of time points equal to the number of products;

Multiple product queues corresponding to the multiple time pairs are determined according to the mapping relationship between the sequence of time points and the sequence of product numbers.

The multiple time points in the time queue are sorted in chronological order, so that the time sequence number of each time point in the time queue can be determined, and the multiple product queues can be determined according to the rule that the time sequence number corresponds to the product number.

For example: the total number of products is 5, time queue X _i = (1.125,0.765,1.689,0.235,0.569), after sorting X _i in positive order, get in, is 0.235, corresponding to X _i4 ; is 0.569, corresponding to X _i5 , and so on, then the transformed product queue is (4, 3, 5, 1, 2).

In this embodiment, step 301 is not limited to this implementation manner, and the product queue including n products may also be randomly disrupted to obtain multiple product queues, which is not limited in this embodiment.

It should be noted that, the foregoing implementation manner in step 301 may also be applied to step 101 in the embodiment shown in FIG. 1 .

Step 302: Obtain the total assembly time for all products in each product queue to complete assembly according to the preset scheduling rule and the product queue, wherein the preset scheduling rule includes the selection of multiple assembly teams for the product in the same process Strategies, sequencing strategies for products, and assembly parameters.

For the implementation process and beneficial effects of step 301 and step 302, reference may be made to the description in step 101 and step 102, which will not be repeated here.

Step 303: Determine the first product queue with the shortest total assembly time among the product queues;

After the total assembly time of multiple product queues is obtained in step 302, the first product queue with the shortest total assembly time is determined from the multiple product queues.

Step 304: Perform an insert operation on the first product queue to obtain a second product queue, and perform a mixed neighborhood local search operation on the second product queue according to the preset scheduling rules, and filter out products based on the second product queue. The third product queue with the shortest total assembly time of the product queue;

The insert operation is to randomly select two positions in the product queue, and put the product number of one position into the other position, and the total number of products in the product queue remains unchanged. For example: the first product queue is (3, 4, 2, 1), and the two randomly selected positions are the first position and the fourth position, then the second product queue formed after insertion is (4, 2, 3 ,1).

The exchange operation is to randomly select two positions in the product queue, and exchange the product numbers of these two positions, and the total number of products in the product queue remains unchanged. For example: the second product queue is (4, 2, 3, 1), and the two randomly selected positions are the second position and the fourth position, then the fourth product queue formed after the exchange is (4, 1, 3 ,2).

After the second product queue is obtained, a mixed neighborhood local search is performed on the second product queue. In this embodiment, the number of mixed domain local searches can be one time or multiple times, which is not limited in this embodiment of the present invention. In each local search process, only the above-mentioned insertion operation or the above-mentioned exchange operation can be selected, and the insertion operation and the exchange operation can also be alternately operated on the product queue with the shortest assembly time in the previous partial search, so as to achieve local The third product queue with the shortest total assembly time based on the second product queue is selected during the search.

Optionally, in a feasible implementation manner, step 304 may be specifically: performing an insert operation on the first product queue to obtain a second product queue, and queue, obtaining the total assembly time of the second product queue; performing an insert operation or an exchange operation on the second product queue to obtain a fourth product queue, and according to the preset scheduling rule and the fourth product queue, Obtaining the total assembly time of the fourth product queue; if the total assembly time of the fourth product queue is less than the total assembly time of the second product queue, updating the second product queue to the fourth product queue, Adding 1 to the first number of iterations, and performing the insert operation or exchange operation on the second product queue to obtain a fourth product queue, and according to the preset scheduling rule and the fourth product queue, obtain the Describe the step of the total assembly time length of the fourth product queue; if the total assembly time length of the fourth product queue is not less than the total assembly time length of the second product queue, then add 1 to the first number of iterations, and execute the described process for all performing an insert operation or an exchange operation on the second product queue to obtain a fourth product queue, and obtaining the total assembly duration of the fourth product queue according to the preset scheduling rule and the fourth product queue; when the If the first number of iterations is not less than the first preset number of iterations, the second product queue is used as the third product queue.

Each local search will compare the total assembly time of the second product queue with the total assembly time of the fourth product queue. When the total assembly time of the fourth product queue is obtained after the insertion or exchange operation of the second product queue When it is not less than the total assembly time of the second product queue, discard the fourth product queue, turn to the next partial search, and re-insert or exchange the second product queue to obtain a new fourth product queue. Compare; when the total assembly time of the fourth product queue is less than the total assembly time of the second product queue, replace the second product queue with the fourth product queue, and then enter the next local search, and search for the new second product queue The new fourth product queue obtained by performing an insert operation or an exchange operation is compared again until the number of local searches reaches the first preset number of falls.

Wherein, the first number of iterations is the number of local searches. In this embodiment, the first number of iterations is n*(n+1). When the first number of iterations is less than the first preset number of iterations n*(n+1), continue Repeatedly screen out the product queue with the shortest total assembly time based on the second product queue; when the first iteration number is not less than the first preset iteration number n*(n+1), the previously screened out total assembly time is the shortest The second product queue of is used as the third product queue.

For example: the total number n of products in the product queue is 5, the first product queue is (5, 2, 4, 3, 1), and the insertion operation is performed on the first product queue to obtain the second product queue as (2, 4, 3, 5 , 1), and calculate the total assembly time of the second product queue (2, 4, 3, 5, 1) according to the preset scheduling rules as A1; The insertion operation or the exchange operation obtains the fourth product queue as (4, 2, 3, 5, 1), and calculates the total assembly time of the fourth product queue (4, 2, 3, 5, 1) according to the preset scheduling rule as A2; if A2<A1, update the second product queue from (2, 4, 3, 5, 1) to (4, 2, 3, 5, 1), and add the first iteration number X from 0 to 1; when X is less than the first preset number of iterations 30, continue to insert or exchange the second product queue (4, 2, 3, 5, 1) to obtain the fourth product queue as (4, 2, 5, 3 , 1), and calculate the total assembly time of the fourth product queue (4, 2, 5, 3, 1) according to the preset scheduling rule as A3; if A3>A2, add X from 1 to 2; when X is less than The first preset number of iterations is 30, continue to insert or exchange operations on the second product queue (4, 2, 3, 5, 1) to obtain the fourth product queue, and so on...until X is not less than the first preset If the number of iterations is 30, the previously screened second product queue with the shortest total assembly time is used as the third product queue with the shortest total assembly time based on the second product queue.

In this embodiment, the partial search is continuously performed on the second product queue with the shortest total assembly time, which can improve the screening efficiency of the third product queue.

It should be noted that step 304 is not limited to this implementation, for example, using different first iteration times, different local search strategies, or inserting or replacing the second product queue at one time to obtain the preset number The fourth product queue, the product queue with the shortest total assembly time will be determined from all the fourth product queues as the third product queue, and the third product queue with the shortest total assembly time based on the second product queue can be obtained. The embodiment of the invention does not limit this.

Step 305: If the total assembly time of the third product queue is less than the total assembly time of the first product queue, update the target product queue to the third product queue, generate and output assembly scheduling information, and The assembly scheduling information includes the product order of the n products entering the assembly process represented by the updated target product queue.

When the total assembly duration of the third product queue is less than the total assembly duration of the first product queue, the target product queue is updated to the third product queue, and the generated assembly scheduling information includes the third product queue representation The product sequence of the n products entering the assembly process.

For the implementation process and beneficial effects of this step, reference may be made to the description in step 103, which will not be repeated here.

The second product queue is obtained by inserting the first product queue with the shortest total assembly time among the multiple product queues, and then the mixed neighborhood local search operation is performed on the second product queue to filter out the total product queue based on the second product queue. The third product queue with the shortest assembly time; compare the total assembly time of the first product queue and the third product queue, and use the shortest total assembly time as the target product queue to generate assembly scheduling information. In this way, the convergence speed in the calculation process of the method for generating assembly scheduling information of the present invention can be improved.

Please refer to FIG. 4 . FIG. 4 is a schematic flowchart of a method for generating assembly scheduling information according to another embodiment of the present invention. As shown in Figure 4, it includes the following steps:

Step 401: Obtain multiple product queues of the current iteration round, wherein each product queue is used to represent the product sequence of n products entering the assembly process, and different product queues indicate that the product sequences of the n products are different. n is an integer greater than or equal to 2.

For the implementation process and beneficial effects of this step, reference may be made to the description in step 101, which will not be repeated here.

In this embodiment, step 401 to step 407 is an iterative step. The second preset number of iterations is a preset value, which may be 20, 50, or 100, etc., which is not limited in this embodiment.

Step 402: Obtain the total assembly time of all products in each product queue according to the preset scheduling rule and the product queue, wherein the preset scheduling rule includes the selection of multiple assembly teams for the product in the same process Strategies, sequencing strategies for products, and assembly parameters.

For the implementation process and beneficial effects of this step, reference may be made to the description in step 102, which will not be repeated here.

Step 403: Determine the fifth product queue with the shortest total assembly time in the current iteration round, and add 1 to the second iteration number.

Step 402 obtains the total assembly time of multiple product queues in the current iteration, and determines the fifth product queue with the shortest total assembly time.

Step 404: Determine whether the total assembly time of the fifth product queue is shorter than the sixth product queue with the shortest total assembly time among the completed iterations.

If the total assembly time of the fifth product queue is less than the sixth product queue with the shortest total assembly time in the number of completed iterations, perform step 405: update the sixth product queue to the fifth product queue, and The sixth product queue does not update the algebra to perform the clearing operation;

Step 403 will determine the fifth product queue corresponding to that iteration round from the multiple product queues in each iterative round, by comparing the total assembly time of the determined multiple fifth product queues, it can be determined The sixth product queue with the shortest total assembly time in the iterated rounds.

Compare the total assembly time of the fifth product queue with the shortest total assembly time in the current iteration round with the sixth product queue, if the total assembly time of the fifth product queue in the current iteration round is less than the total assembly time of the sixth product queue , update the sixth product queue to the fifth product queue of the current iteration round, and clear the unupdated generations of the sixth product queue.

If the total assembly time of the fifth product queue is not less than the total assembly time of the sixth product queue, perform step 406: if the total assembly time of the fifth product queue is not less than the total assembly time of the sixth product queue assembly time, add 1 to the unupdated generation number of the sixth product queue;

For example: the total assembly time of the fifth product queue L1 in the first iteration round is B1, then the sixth product queue is also L1 at this time, and the unupdated generation number of the sixth product queue is 0; enter the second iteration round to determine the first The total assembly time of the fifth product queue L2 in the second iteration round is B2. When B2<B1, the sixth product queue at this time is updated to L2, and the unupdated generation number of the sixth product queue is 0; enter the third iteration round Determine for the first time that the total assembly time of the fifth product queue L3 in the third iteration round is B3. When B3>B2, the sixth product queue at this time is still L2, and the unupdated generation number of the sixth product queue is 1; enter the fourth The iterative round determines that the total assembly time of the fifth product queue L4 in the fourth iteration round is B4. When B4>B2, the sixth product queue at this time is still L2, and the sixth product queue is not updated. And so on...until the second iteration round reaches the second preset iteration round.

Step 407: Determine whether the number of unupdated generations of the sixth product queue is less than a preset threshold.

The number of unupdated generations of the sixth product queue is not less than the preset threshold Limit, then execute step 408: if a new product queue is obtained, and the new product queue is replaced by the preset ratio (1- After the product queue with a longer total assembly time of η), then return to step 402, and re-execute steps 402 to 408. Wherein, the preset threshold value Limit is a preset value, which may be 5, 10, or 20, etc., which is not limited in this embodiment.

When the unupdated generations of the sixth product queue accumulate to no less than the preset threshold value Limit, the newly acquired multiple product queues replace the total number of preset ratios (1-η) in the multiple product queues of this iterative round. Assembling the product queues with a long duration, and executing steps 403 to 405 for multiple product queues after replacement.

If the number of unupdated generations of the sixth product queue is less than the preset threshold Limit, execute step 409: determine whether the second iteration count is less than the second preset iteration count.

If the number of unupdated generations of the sixth product queue is less than the preset threshold Limit, and the second number of iterations is less than the second preset number of iterations, return to step 401, and re-execute steps 401 to 409;

When the second number of iterations is not less than the second preset number of iterations, perform step 410: use the sixth product queue as the target product queue, generate and output assembly scheduling information, the assembly scheduling information includes the target product The queue represents the order in which the n products enter the assembly process.

For the implementation process and beneficial effects of this step, reference may be made to the description in step 103, which will not be repeated here.

Among them, the sixth product queue is the product queue with the shortest total assembly time in the iterated rounds. When the second iteration number is not less than the second preset iteration number, the sixth product queue is the shortest total assembly time among all product queues. product queue.

Through multiple iterations of multiple product queues, save the sixth product queue with the shortest total assembly time in the iterated rounds, and record the unupdated generation of the sixth product queue, and the unupdated generation of the sixth product queue reaches the preset threshold value Limit When , use the newly obtained product queue to replace some of the product queues with long assembly time in this iteration round, and re-screen and compare the replaced multiple product queues until the number of second iterations is not less than the first Second, the number of iterations is preset, so as to effectively avoid falling into the local optimum problem in the process of determining the target product queue point, and achieve the effect of obtaining the global optimum point.

In addition, the preset threshold value Limit and the preset ratio η in this embodiment belong to the assembly parameters in step 402, and the preset threshold value Limit and the preset ratio η are the same as the control interval time and the total number of product queues in step 102 Can affect the total assembly time of the product lineup.

This embodiment can also be combined with the embodiment shown in FIG. 2, that is, step 403 specifically includes: after determining the fifth product queue in the current iteration round, inserting the fifth product queue to obtain the seventh product queue, and according to The preset scheduling rule performs a mixed neighborhood local search operation on the seventh product queue, and screens out the eighth product queue with the shortest total assembly time based on the seventh product queue; comparison, and the product queue with the shortest total assembly time is taken as the fifth product queue.

Now take the discrete random integer with the total number of processes s = 5 and the assembly time of each assembly team as [3, 40] as an example, three tests are carried out for the three cases of product quantity n = 10, 15 and 20, and the obtained test results are . Among them, the assembly parameters in the test are shown in Table 1:

Table 1 Values of each assembly parameter

parameter/level 1 2 3 4 Total Product Queue NP 20 50 80 110 Control time interval Ct 0.5 1.0 1.5 2.0 Time threshold Limit 40 60 80 100 Preset ratio η(Eta) 0.1 0.2 0.3 0.4

The test results include Fig. 5, Fig. 6 and Table 2, wherein Fig. 5 is a performance diagram of the assembly scheduling information generation method provided by another embodiment of the present invention under different levels of assembly parameters; Fig. 6 is another embodiment of the present invention The assembly scheduling information generation method provided by the example is based on the test results obtained in Table 1; Table 2 shows the extreme difference of each assembly parameter.

As shown in Figure 5, it can be seen that the larger the total number of product queues NP, the better the performance of the algorithm, because the total number of product queues NP determines the coverage of the search space. When NP is small, the global exploration performance of the algorithm is poor, and it is easy to prematurely converge and fall into local optimum; when NP is large, the group can cover more search space, and it is easier to obtain high-quality solutions. In addition, the range of improvement is decreasing with the increase of the population size (the difference between level 3 and level 4 is only 0.03), so the NP should not be too large. The parameter _Ct determines the movement range of the algorithm in the entire search space during the optimization process. If _Ct is too large, it will easily lead to too fast convergence and fall into local optimum. If _Ct is too small, it will lead to slow convergence and affect the performance of the algorithm. For the restart operation, the parameter Limit determines the timing of the restart. When the Limit is small, the algorithm is forced to restart before reaching the local optimum. When the retention ratio is large, the algorithm is likely to fall into the local optimum again, resulting in the effect of restarting not being obvious. Combining with Fig. 6, it can be determined that the total assembly time obtained when the parameter combination [3, 2, 4, 1] is the shortest, at this time NP=80, C _t =1.0, Limit=100 and η=0.1.

According to Table 2, it can be seen that the range of Limit and η is the largest, followed by NP, and finally C _t , which can indicate that the embodiment shown in FIG. 3 can significantly improve the performance of the method for generating assembly scheduling information.

Table 2 Range value of each assembly parameter

In addition, please refer to Fig. 7 and Fig. 8, wherein, Fig. 7 is the result diagram of the total assembly duration of the assembly scheduling information generation method of each embodiment of the present invention; Fig. 8 is the average value of the assembly scheduling information generation method of each embodiment of the present invention , a graph of the optimal value and standard deviation. The embodiment of the present invention also compares the embodiment shown in FIG. 1 , the embodiment shown in FIG. 2 , the embodiment shown in FIG. 3 , and the combination of the embodiment shown in FIG. 2 and the embodiment shown in FIG. 3 , wherein The assembly scheduling information generation method of the embodiment shown in Figure 1 is marked as DKH, the assembly scheduling information generation method of the embodiment shown in Figure 2 is marked as DKH-LS, and the assembly scheduling information generation method of the embodiment shown in Figure 3 is marked as DKH-LS RS, the assembly scheduling information generation method of the combined embodiment is marked IDKH. Adopt above-mentioned optimal parameter combination NP=80, C _t =1.0, Limit=100 and η=0.1, each instance is run 20 times, each run time is no more than 20 seconds, record the average value AVE of 20 run results, the most figure of merit MIN and standard deviation STD.

Please refer to FIG. 7 and FIG. 8, wherein, FIG. 7 is a result graph of the total assembly time of various embodiments of the present invention; FIG. 8 is a graph of average values, optimal values and standard deviations of various embodiments of the present invention. As shown in Fig. 7 and Fig. 8, after the embodiment shown in Fig. 2 can be obtained by adding the local search, AVE, MIN and STD are all optimized, thereby improving the overall optimization performance and robustness of the method for generating assembly scheduling information; Obtain the embodiment shown in Figure 3 by adding the restart operation, AVE and STD have been optimized, that is, the average optimization and robustness of the assembly scheduling information generation method have been enhanced; comprehensively, the combined embodiment can be obtained with Figure 2 embodiment and Advantages of the embodiment of Fig. 3, the performance is the best.

Please refer to FIG. 9. FIG. 9 is a schematic structural diagram of an assembly scheduling information generation system provided by an embodiment of the present invention. As shown in FIG. 9, the assembly scheduling information generation system 900 includes a first acquisition module 901, a second acquisition module 902, and an output module 903, wherein the first acquisition module 901 is connected to the second acquisition module 902, and the second acquisition module 902 is connected to the output module 903.

The first obtaining module 901 is used to obtain multiple product queues, wherein each product queue is used to represent the product sequence of n products entering the assembly process, and different product queues indicate that the product sequences of the n products are different. n is an integer greater than or equal to 2;

The second acquisition module 902 is used to obtain the total assembly time of all products in each product queue according to the preset scheduling rule and the product queue, wherein the preset scheduling rule includes that the product is in the same process to many The selection strategy of an assembly team, the sequencing strategy of products and the assembly parameters;

The output module 903 is configured to determine the target product queue with the shortest total assembly time, generate and output assembly scheduling information, and the assembly scheduling information includes the product order of the n products entering the assembly process represented by the target product queue.

Optionally, as shown in FIG. 10, the output module 903 includes:

The first determination sub-module 9031 is used to determine the first product queue with the shortest total assembly time in the product queue;

The screening sub-module 9032 is configured to perform an insert operation on the first product queue to obtain a second product queue, and perform a mixed neighborhood local search operation on the second product queue according to the preset dispatching rule, and filter out products based on The third product queue with the shortest total assembly time of the second product queue;

The output sub-module 9033 is configured to update the target product queue to the third product queue if the total assembly time of the third product queue is less than the total assembly time of the first product queue, and generate and output the assembly Scheduling information, where the assembly scheduling information includes the sequence of the n products entering the assembly process represented by the updated target product queue.

Optionally, as shown in Figure 11, the screening submodule 9032 includes:

The first acquisition unit 90321 is configured to perform an insert operation on the first product queue to obtain a second product queue, and obtain the total number of the second product queue according to the preset scheduling rule and the second product queue Assembly time;

The second obtaining unit 90322 is configured to perform an insert operation or an exchange operation on the second product queue to obtain a fourth product queue, and obtain the fourth product according to the preset scheduling rule and the fourth product queue The total assembly time of the queue;

The first counting unit 90323 is used to update the second product queue to the fourth product queue if the total assembly time of the fourth product queue is less than the total assembly time of the second product queue, and the first iteration The number of times is increased by 1, and the insertion operation or exchange operation on the second product queue is performed to obtain the fourth product queue, and the fourth product is obtained according to the preset scheduling rule and the fourth product queue The steps of the total assembly time of the queue;

The second counting unit 90324 is configured to add 1 to the first iteration number if the total assembly duration of the fourth product queue is not less than the total assembly duration of the second product queue, and execute the pair of the second product performing an insertion or exchange operation on the queue to obtain a fourth product queue, and obtaining the total assembly time of the fourth product queue according to the preset scheduling rule and the fourth product queue;

The determining unit 90325 is configured to use the second product queue as the third product queue when the first iteration number is not less than a first preset iteration number.

Optionally, as shown in Figure 12, the first acquisition module is used to acquire multiple product queues of the current iteration round;

The assembly scheduling information generation system 900 also includes:

A determining module 904, configured to determine the fifth product queue with the shortest total assembly time in the current iteration round, and add 1 to the second iteration number;

The first counting module 905 is configured to update the sixth product queue to the fifth product if the total assembly time of the fifth product queue is less than the sixth product queue with the shortest total assembly time among the completed iterations queue, and clear the unupdated algebra of the sixth product queue;

The second counting module 906 is used to add 1 to the number of unupdated generations of the sixth product queue if the total assembly time of the fifth product queue is not less than the total assembly time of the sixth product queue;

The first execution module 907 is configured to obtain a new product queue if the number of unupdated generations of the sixth product queue is not less than the preset threshold value, and replace the new product queue with the preset ratio in the current iteration round After the product queue with a longer total assembly time, execute the step of obtaining the total assembly time of each product according to the preset scheduling rule and the replaced product queue;

The second execution module 908 is configured to execute obtaining the number of next iteration rounds if the number of unupdated generations of the sixth product queue is less than the preset threshold value and the second iteration number is smaller than the second preset iteration number. the steps of a product queue;

The output module 903 is configured to use the sixth product queue as the target product queue.

Optionally, as shown in FIG. 13, the first obtaining module 901 includes:

Generating sub-module 9011, configured to generate multiple time pairs, each time pair including multiple time points equal to the number of multiple products;

The second determination sub-module 9012 is configured to determine multiple product queues corresponding to the multiple time pairs according to the mapping relationship between the sequence of time points and the sequence of product numbers.

Optionally, the second acquisition module 902 is used to determine the earliest allowable processing time point of the product in the process and the assembly time of each assembly team in the process for each process in the assembly process; The processing time point and the assembly time of each assembly team in this process are calculated, and the multiple completion time points of the product assembled by multiple assembly teams are calculated; the first assembly team with the earliest completion time point is selected to assemble the product.

Optionally, the second acquisition module 902 is also used to select the second assembly team with the shortest assembly time in this process in the first assembly team if there are more than one first assembly team to carry out the process on the product. assembly.

Optionally, the second acquisition module 902 is also used to determine the release time of multiple second assembly teams if there are multiple second assembly teams; calculate the earliest allowable processing time of the product in this process The difference between the point and the release time of multiple second assembly teams is selected, and the third assembly team with the smallest difference is selected to assemble the product.

Optionally, the second acquisition module 902 is configured to determine the processing sequence of each product in the first process according to the product queue, and the remaining processes except the first process are sequentially processed according to the time sequence of the products arriving .

The assembly scheduling information generation system 900 of the embodiment of the invention can implement various processes implemented by the electronic device in the method embodiments shown in FIGS. 1 to 8 . To avoid repetition, details are not repeated here.

The assembly scheduling information generation system 900 of the embodiment of the present invention can determine the product sequence of n products with the shortest total assembly time entering the assembly process from a large number of product queues, improve the assembly efficiency of the workshop when applying assembly scheduling information, and shorten the total time of the workshop. Assembly time.

Please refer to FIG. 14. FIG. 14 is a schematic diagram of the hardware structure of an electronic device implementing various embodiments of the present invention. The electronic device 1400 includes but is not limited to: a radio frequency unit 1401, a network module 1402, an audio output unit 1403, an input unit 1404, Sensor 1405 , display unit 1406 , user input unit 1407 , interface unit 1408 , memory 1409 , processor 1410 , power supply 1411 and other components. Those skilled in the art can understand that the structure of the electronic device shown in Figure 10 does not constitute a limitation to the electronic device, and the electronic device may include more or less components than shown in the illustration, or combine some components, or different components layout. In the embodiment of the present invention, electronic devices include but are not limited to mobile phones, tablet computers, notebook computers, palmtop computers, vehicle-mounted terminals, wearable devices, and pedometers.

Wherein, the processor 1410 is used to obtain multiple product queues, wherein each product queue is used to represent the product sequence of n products entering the assembly process, and different product queues indicate that the product sequences of the n products are different. n is an integer greater than or equal to 2; according to the preset scheduling rule and the product queue, the total assembly time for all products in each product queue to complete the assembly is obtained, wherein the preset scheduling rule includes that the product is assembled in the same process Multiple assembly team selection strategies, product sorting strategies, and assembly parameters; determine the target product queue with the shortest total assembly time, generate and output assembly scheduling information, and the assembly scheduling information includes the n items represented by the target product queue The product sequence in which products enter the assembly process.

Optionally, the processor 1410, in the step of determining the target product queue with the shortest total assembly time and generating and outputting assembly scheduling information, includes: determining the first product queue with the shortest total assembly time in the product queue; Perform an insertion operation on the first product queue to obtain a second product queue, and perform a mixed neighborhood local search operation on the second product queue according to the preset scheduling rules, and filter out the total assembly time based on the second product queue The shortest third product queue; if the total assembly time of the third product queue is less than the total assembly time of the first product queue, update the target product queue to the third product queue, generate and output the assembly Scheduling information, where the assembly scheduling information includes the product order of the n products entering the assembly process represented by the updated target product queue.

Optionally, the processor 1410 performs an insert operation on the first product queue to obtain a second product queue, and performs a hybrid neighborhood local search operation on the second product queue according to the preset scheduling rule, and filters The step of obtaining the third product queue with the shortest total assembly time based on the second product queue includes: performing an insert operation on the first product queue to obtain the second product queue, and according to the preset scheduling rules and The second product queue obtains the total assembly time of the second product queue; performs an insert operation or an exchange operation on the second product queue to obtain a fourth product queue, and according to the preset scheduling rule and the The fourth product queue, obtaining the total assembly time of the fourth product queue; if the total assembly time of the fourth product queue is less than the total assembly time of the second product queue, the second product queue is updated as For the fourth product queue, add 1 to the first iteration number, and perform the insertion operation or exchange operation on the second product queue to obtain the fourth product queue, and according to the preset scheduling rule and the fourth product queue Product queue, the step of obtaining the total assembly time of the fourth product queue; if the total assembly time of the fourth product queue is not less than the total assembly time of the second product queue, then add 1 to the first iteration number, Executing the insertion or exchange operation on the second product queue to obtain a fourth product queue, and obtaining the total assembly time of the fourth product queue according to the preset scheduling rules and the fourth product queue The step; when the first iteration number is not less than the first preset iteration number, then use the second product queue as the third product queue.

Optionally, the processor 1410, in the step of acquiring multiple product queues, includes: acquiring multiple product queues of the current iteration round; After the step of completing the total assembly time of all products, it also includes: determining the fifth product queue with the shortest total assembly time in the current iteration round, and adding 1 to the second iteration number; if the total assembly of the fifth product queue If the duration is less than the sixth product queue with the shortest total assembly time in the number of completed iterations, then update the sixth product queue to the fifth product queue, and clear the unupdated generations of the sixth product queue; if The total assembly time of the fifth product queue is not less than the total assembly time of the sixth product queue, then add 1 to the unupdated generation number of the sixth product queue; if the unupdated generation number of the sixth product queue is not less than the preset threshold value, then obtain a new product queue, and replace the new product queue with the product queue with a preset proportion of the total assembly time in the current iterative round, and then execute the preset scheduling rule and after the replacement The step of obtaining the total assembly time of each of the product queues; if the number of unupdated generations of the sixth product queue is less than the preset threshold value, and the second iteration number is less than the second preset iteration number , then execute the step of obtaining multiple product queues of the next iteration round; in the step of determining the target product queue with the shortest total assembly time, including: taking the sixth product queue as the target product queue.

Optionally, the processor 1410, in the step of obtaining multiple product queues, includes: generating multiple time pairs, each time pair including multiple time points equal to the number of multiple products; The mapping relationship between the sequence of the sequence and the sequence of the product numbers determines the multiple product queues corresponding to the multiple time pairs.

Optionally, processor 1410, each selection strategy includes: for each process in the assembly process, determine the earliest allowable processing time point of the product in this process and the assembly time of each assembly team in this process; according to the earliest The processing time point and the assembly time of each assembly team in this process are allowed, and the multiple completion time points of the product assembled by multiple assembly teams are calculated; the first assembly team with the earliest completion time point is selected to assemble the product.

Optionally, the processor 1410, each selection strategy further includes: if there are multiple first assembly teams, selecting the second assembly team with the shortest assembly time for the process in the first assembly team for the first assembly team. The product is assembled.

Optionally, each selection strategy also includes: if there are multiple second assembly teams, then determining the release time of multiple second assembly teams; The difference between the release time of the second assembly team and the third assembly team with the smallest difference is selected to assemble the product.

Optionally, each sorting strategy includes: determining the processing sequence of each product in the first process according to the product queue, and the other processes except the first process are sequentially processed according to the time sequence of the products in place.

The electronic device 1400 can implement various processes implemented by the assembly scheduling information generation system in the foregoing embodiments, and details are not repeated here to avoid repetition.

The electronic device 1400 in the embodiment of the present invention can determine the product sequence of n products with the shortest total assembly time entering the assembly process from a large number of product queues, improve the assembly efficiency of the workshop when applying assembly scheduling information, and shorten the total assembly time of the workshop.

It should be understood that, in the embodiment of the present invention, the radio frequency unit 1401 can be used for receiving and sending signals during sending and receiving information or during a call. Specifically, the downlink data from the base station is received and processed by the processor 1410; Uplink data is sent to the base station. Generally, the radio frequency unit 1401 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, and the like. In addition, the radio frequency unit 1401 can also communicate with the network and other devices through a wireless communication system.

The electronic device provides users with wireless broadband Internet access through the network module 1402, such as helping users send and receive emails, browse web pages, and access streaming media.

The audio output unit 1403 may convert audio data received by the radio frequency unit 1401 or the network module 1402 or stored in the memory 1409 into an audio signal and output as sound. Also, the audio output unit 1403 may also provide audio output related to a specific function performed by the electronic device 1400 (for example, a call signal reception sound, a message reception sound, etc.). The audio output unit 1403 includes a speaker, a buzzer, a receiver, and the like.

The input unit 1404 is used to receive audio or video signals. The input unit 1404 may include a graphics processor (Graphics Processing Unit, GPU) 10041 and a microphone 10042, and the graphics processor 10041 is used for still pictures or video images obtained by an image capture device (such as a camera) in a video capture mode or an image capture mode. The data is processed. The processed image frames may be displayed on the display unit 1406 . The image frames processed by the graphics processor 10041 may be stored in the memory 1409 (or other storage media) or sent via the radio frequency unit 1401 or the network module 1402 . The microphone 10042 can receive sound, and can process such sound into audio data. The processed audio data may be converted into an output format transmittable to a mobile communication base station via the radio frequency unit 1401 in case of a phone call mode.

The electronic device 1400 also includes at least one sensor 1405, such as a light sensor, a motion sensor, and other sensors. Specifically, the light sensor includes an ambient light sensor and a proximity sensor, wherein the ambient light sensor can adjust the brightness of the display panel 10061 according to the brightness of the ambient light, and the proximity sensor can turn off the display panel 10061 and the / or backlighting. As a kind of motion sensor, the accelerometer sensor can detect the magnitude of acceleration in various directions (generally three axes), and can detect the magnitude and direction of gravity when it is still, and can be used to identify the posture of electronic equipment (such as horizontal and vertical screen switching, related games) , magnetometer attitude calibration), vibration recognition-related functions (such as pedometer, knocking), etc.; the sensor 1405 can also include fingerprint sensors, pressure sensors, iris sensors, molecular sensors, gyroscopes, barometers, hygrometers, thermometers, Infrared sensors, etc., will not be repeated here.

The display unit 1406 is used to display information input by the user or information provided to the user. The display unit 1406 may include a display panel 10061, and the display panel 10061 may be configured in the form of a liquid crystal display (Liquid Crystal Display, LCD), an organic light-emitting diode (Organic Light-Emitting Diode, OLED), or the like.

The user input unit 1407 can be used to receive input numbers or character information, and generate key signal input related to user settings and function control of the electronic device. Specifically, the user input unit 1407 includes a touch panel 10071 and other input devices 10072 . The touch panel 10071, also referred to as a touch screen, can collect touch operations of the user on or near it (for example, the user uses any suitable object or accessory such as a finger and a stylus on the touch panel 10071 or near the touch panel 10071 operate). The touch panel 10071 may include two parts, a touch detection device and a touch controller. Among them, the touch detection device detects the user's touch orientation, and detects the signal brought by the touch operation, and transmits the signal to the touch controller; the touch controller receives the touch information from the touch detection device, converts it into contact coordinates, and sends it to the For the processor 1410, receive the command sent by the processor 1410 and execute it. In addition, the touch panel 10071 can be implemented in various types such as resistive, capacitive, infrared, and surface acoustic wave. In addition to the touch panel 10071 , the user input unit 1407 may also include other input devices 10072 . Specifically, other input devices 10072 may include, but are not limited to, physical keyboards, function keys (such as volume control keys, switch keys, etc.), trackballs, mice, and joysticks, which will not be repeated here.

Furthermore, the touch panel 10071 can be covered on the display panel 10061, and when the touch panel 10071 detects a touch operation on or near it, it will be sent to the processor 1410 to determine the type of the touch event, and then the processor 1410 according to the touch The type of event provides a corresponding visual output on the display panel 10061. Although in FIG. 10, the touch panel 10071 and the display panel 10061 are used as two independent components to realize the input and output functions of the electronic device, in some embodiments, the touch panel 10071 and the display panel 10061 can be integrated. The implementation of the input and output functions of the electronic device is not specifically limited here.

The interface unit 1408 is an interface for connecting an external device to the electronic device 1400 . For example, an external device may include a wired or wireless headset port, an external power (or battery charger) port, a wired or wireless data port, a memory card port, a port for connecting a device with an identification module, audio input/output (I/O) ports, video I/O ports, headphone ports, and more. The interface unit 1408 can be used to receive input from an external device (for example, data information, power, etc.) transfer data between devices.

The memory 1409 can be used to store software programs as well as various data. The memory 1409 can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application program required by a function (such as a sound playback function, an image playback function, etc.) and the like; Data created by the use of mobile phones (such as audio data, phonebook, etc.), etc. In addition, the memory 1409 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage devices.

The processor 1410 is the control center of the electronic device. It uses various interfaces and lines to connect various parts of the entire electronic device. By running or executing software programs and/or modules stored in the memory 1409, and calling data stored in the memory 1409 , to perform various functions of the electronic equipment and process data, so as to monitor the electronic equipment as a whole. The processor 1410 may include one or more processing units; preferably, the processor 1410 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface and application programs, etc., and the modem The processor mainly handles wireless communication. It can be understood that the foregoing modem processor may not be integrated into the processor 1410 .

The electronic device 1400 can also include a power supply 1411 (such as a battery) for supplying power to various components. Preferably, the power supply 1411 can be logically connected to the processor 1410 through a power management system, so as to manage charging, discharging, and power consumption through the power management system. and other functions.

In addition, the electronic device 1400 includes some functional modules not shown, which will not be repeated here.

Preferably, the embodiment of the present invention also provides an electronic device, including a processor 1410, a memory 1409, and a computer program stored in the memory 1409 and operable on the processor 1410, when the computer program is executed by the processor 1410 Each process of the above embodiment of the method for generating assembly scheduling information can be realized, and the same technical effect can be achieved. To avoid repetition, details are not repeated here.

The embodiment of the present invention also provides a computer-readable storage medium. A computer program is stored on the computer-readable storage medium. When the computer program is executed by a processor, each process of the above-mentioned assembly scheduling information generation method embodiment is realized, and the same To avoid repetition, the technical effects will not be repeated here. Wherein, the computer-readable storage medium is, for example, a read-only memory (Read-Only Memory, ROM for short), a random access memory (Random Access Memory, RAM for short), a magnetic disk or an optical disk, and the like.

It should be noted that, in this document, the term "comprising", "comprising" or any other variation thereof is intended to cover a non-exclusive inclusion such that a process, method, article or apparatus comprising a set of elements includes not only those elements, It also includes other elements not expressly listed, or elements inherent in the process, method, article, or device. Without further limitations, an element defined by the phrase "comprising a ..." does not preclude the presence of additional identical elements in the process, method, article, or apparatus comprising that element.

Through the description of the above embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus a necessary general-purpose hardware platform, and of course also by hardware, but in many cases the former is better implementation. Based on such an understanding, the essence of the technical solution of the present invention or the part that contributes to the prior art can be embodied in the form of software products, and the computer software products are stored in a storage medium (such as ROM/RAM, disk, CD) contains several instructions to make a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) execute the methods described in various embodiments of the present invention.

Embodiments of the present invention have been described above in conjunction with the accompanying drawings, but the present invention is not limited to the above-mentioned specific implementations, and the above-mentioned specific implementations are only illustrative, rather than restrictive, and those of ordinary skill in the art will Under the enlightenment of the present invention, without departing from the gist of the present invention and the protection scope of the claims, many forms can also be made, all of which belong to the protection of the present invention.

Claims (20)

1. A method for generating assembly scheduling information, the method comprising:

obtaining a plurality of product queues, wherein each product queue is used for representing the product sequence of n products entering an assembly process, different product queues represent that the product sequences of the n products are different, and n is an integer greater than or equal to 2;

acquiring the total assembly time of all products assembled in each product queue according to a preset scheduling rule and the product queues, wherein the preset scheduling rule comprises a selection strategy of the products to a plurality of assembly groups in the same procedure, a sorting strategy of the products and assembly parameters;

and determining a target product queue with the shortest total assembly time length, and generating and outputting assembly scheduling information, wherein the assembly scheduling information comprises the product sequence of the n products entering the assembly process, which is represented by the target product queue.

2. The assembly scheduling information generating method according to claim 1, wherein the step of determining the target product queue having the shortest total assembly time length, and generating and outputting the assembly scheduling information comprises:

determining a first product queue with the shortest total assembly time length in the product queues;

performing insertion operation on the first product queue to obtain a second product queue, performing mixed neighborhood local search operation on the second product queue according to the preset scheduling rule, and screening out a third product queue with the shortest total assembly time based on the second product queue;

if the total assembly time of the third product queue is shorter than the total assembly time of the first product queue, updating the target product queue to the third product queue, and generating and outputting assembly scheduling information, wherein the assembly scheduling information comprises the updated product sequence of the n products entering the assembly process, which is represented by the target product queue.

3. The assembly scheduling information generating method according to claim 2, wherein the step of performing an insertion operation on the first product queue to obtain a second product queue, performing a mixed neighborhood local search operation on the second product queue according to the preset scheduling rule, and screening a third product queue having the shortest total assembly duration based on the second product queue includes:

performing insertion operation on the first product queue to obtain a second product queue, and acquiring the total assembly time of the second product queue according to the preset scheduling rule and the second product queue;

performing insertion operation or exchange operation on the second product queue to obtain a fourth product queue, and acquiring the total assembly time of the fourth product queue according to the preset scheduling rule and the fourth product queue;

if the total assembly time of the fourth product queue is less than the total assembly time of the second product queue, updating the second product queue to a fourth product queue, adding 1 to the first iteration number, executing the insertion operation or the exchange operation of the second product queue to obtain a fourth product queue, and acquiring the total assembly time of the fourth product queue according to the preset scheduling rule and the fourth product queue;

if the total assembly time of the fourth product queue is not less than the total assembly time of the second product queue, adding 1 to the first iteration number, executing the insertion operation or the exchange operation on the second product queue to obtain a fourth product queue, and acquiring the total assembly time of the fourth product queue according to the preset scheduling rule and the fourth product queue;

and when the first iteration times are not less than the first preset iteration times, taking the second product queue as a third product queue.

4. The assembly scheduling information generating method according to claim 1, wherein the step of acquiring a plurality of product queues includes:

obtaining a plurality of product queues of a current iteration turn;

after the step of obtaining the total assembly time length of all the products assembled in each product queue according to the preset scheduling rule and the product queues, the method further comprises the following steps:

determining a fifth product queue with the shortest total assembly time in the current iteration round, and adding 1 to the second iteration number;

if the total assembly time of the fifth product queue is less than the sixth product queue with the shortest total assembly time in the number of finished iterations, updating the sixth product queue to the fifth product queue, and performing zero clearing operation on the un-updated algebra of the sixth product queue;

if the total assembly time of the fifth product queue is not less than the total assembly time of the sixth product queue, adding 1 to the un-updated algebra of the sixth product queue;

if the number of generations of the sixth product queue which is not updated is not less than a preset threshold value, acquiring a new product queue, replacing the product queue with a longer total assembly time length in a preset proportion in the current iteration turn by the new product queue, and then executing the step of acquiring the total assembly time length of each product according to a preset scheduling rule and the replaced product queue;

if the number of times of the non-updated algebra of the sixth product queue is smaller than a preset threshold value and the second iteration number is smaller than a second preset iteration number, executing a step of obtaining a plurality of product queues of the next iteration number;

the step of determining the target product queue with the shortest total assembly time duration includes:

and taking the sixth product queue as the target product queue.

5. The assembly scheduling information generating method according to any one of claims 1 to 4, wherein the step of acquiring a plurality of product queues includes:

generating a plurality of time-aligned columns, each time-aligned column including a plurality of time points equal to the number of the plurality of products;

and determining a plurality of product queues corresponding to the plurality of time alignments according to the mapping relation between the sequence of the time points and the product numbering sequence.

6. The assembly scheduling information generating method according to claim 1, wherein each selection policy includes:

for each process in the assembly processes, determining the earliest permitted processing time point of a product in the process and the assembly time length of each assembly team in the process; calculating a plurality of finishing time points of the product assembled by a plurality of assembly groups according to the earliest permitted processing time point and the assembly time length of each assembly group in the process; and selecting a first assembly team with the earliest finishing time point to assemble the product.

7. The assembly scheduling information generating method of claim 6 wherein each selection policy further comprises:

and if the first assembly team is multiple, selecting a second assembly team with the shortest assembly length in the first assembly team to assemble the product.

8. The assembly scheduling information generating method of claim 7, wherein each selection policy further comprises:

if the number of the second assembly groups is multiple, determining the release time of the second assembly groups;

and calculating the difference between the earliest permitted processing time point of the product in the process and the release time of the plurality of second assembly groups, and selecting a third assembly group with the minimum difference to assemble the product.

9. The assembly scheduling information generating method according to claim 1, wherein each ordering policy includes:

and determining the processing sequence of each product in the first procedure according to the product queue, and sequentially processing the other procedures except the first procedure according to the in-place time sequence of the products.

10. An assembly scheduling information generating system, comprising:

the system comprises a first obtaining module, a second obtaining module and a third obtaining module, wherein the first obtaining module is used for obtaining a plurality of product queues, each product queue is used for representing the product sequence of n products entering an assembly process, different product queues represent that the product sequences of the n products are different, and n is an integer greater than or equal to 2;

the second obtaining module is used for obtaining the total assembly time length of all the products assembled in each product queue according to a preset scheduling rule and the product queues, wherein the preset scheduling rule comprises a selection strategy of the products to a plurality of assembly groups in the same procedure, a sorting strategy of the products and assembly parameters;

and the output module is used for determining the target product queue with the shortest total assembly time length, and generating and outputting assembly scheduling information, wherein the assembly scheduling information comprises the product sequence of the n products entering the assembly process, which is represented by the target product queue.

11. The assembly schedule information generating system of claim 10 wherein the output module comprises:

the first determining submodule is used for determining a first product queue with the shortest total assembly time length in the product queues;

the screening submodule is used for performing insertion operation on the first product queue to obtain a second product queue, performing mixed neighborhood local search operation on the second product queue according to the preset scheduling rule, and screening out a third product queue based on the second product queue and having the shortest total assembly time;

and the output submodule is used for updating the target product queue to the third product queue and generating and outputting assembly scheduling information if the total assembly time length of the third product queue is less than the total assembly time length of the first product queue, wherein the assembly scheduling information comprises the updated product sequence of the n products, which is represented by the target product queue, entering the assembly process.

12. The assembly schedule information generating system of claim 11 wherein the screening submodule includes:

the first obtaining unit is used for performing insertion operation on the first product queue to obtain a second product queue, and obtaining the total assembly time length of the second product queue according to the preset scheduling rule and the second product queue;

a second obtaining unit, configured to perform an insertion operation or an exchange operation on the second product queue to obtain a fourth product queue, and obtain a total assembly duration of the fourth product queue according to the preset scheduling rule and the fourth product queue;

a first counting unit, configured to update the second product queue to a fourth product queue if the total assembly time of the fourth product queue is less than the total assembly time of the second product queue, add 1 to a first iteration number, perform an insertion operation or an exchange operation on the second product queue to obtain the fourth product queue, and obtain the total assembly time of the fourth product queue according to the preset scheduling rule and the fourth product queue;

a second counting unit, configured to add 1 to a first iteration number if the total assembly time of the fourth product queue is not less than the total assembly time of the second product queue, perform an insertion operation or an exchange operation on the second product queue to obtain a fourth product queue, and obtain the total assembly time of the fourth product queue according to the preset scheduling rule and the fourth product queue;

and the determining unit is used for taking the second product queue as a third product queue when the first iteration number is not less than a first preset iteration number.

13. The assembly scheduling information generating system of claim 10 wherein the first obtaining module is configured to obtain a plurality of product queues of a current iteration turn;

the assembly scheduling information generating system further includes:

the determining module is used for determining a fifth product queue with the shortest total assembly time in the current iteration round and adding 1 to the second iteration number;

the first counting module is used for updating the sixth product queue to the fifth product queue and carrying out zero clearing operation on the un-updated algebra of the sixth product queue if the total assembly time length of the fifth product queue is smaller than the sixth product queue with the shortest total assembly time length in the number of finished iterations;

the second counting module is used for adding 1 to the un-updated algebra of the sixth product queue if the total assembly time of the fifth product queue is not less than the total assembly time of the sixth product queue;

a first execution module, configured to, if the number of generations of the sixth product queue that is not updated is not less than a preset threshold, obtain a new product queue, replace the product queue with a longer total assembly time length in a current iteration turn according to a preset proportion, and then execute the step of obtaining the total assembly time length of each product according to a preset scheduling rule and the replaced product queue;

a second execution module, configured to execute the step of obtaining multiple product queues of a next iteration if an updated algebra of the sixth product queue is smaller than a preset threshold and the second iteration number is smaller than a second preset iteration number;

and the output module is used for taking the sixth product queue as the target product queue.

14. The assembly scheduling information generating system according to any one of claims 10 to 13, wherein the first obtaining module includes:

a generation submodule for generating a plurality of time alignments, each time alignment including a plurality of time points equal to the number of the plurality of products;

and the second determining submodule is used for determining a plurality of product queues corresponding to the plurality of time alignments according to the mapping relation between the sequence of the time points and the product numbering sequence.

15. The assembly scheduling information generating system of claim 10 wherein the second obtaining module is configured to determine, for each of the assembly processes, an earliest permitted processing time point of the product at the process and an assembly time length of each assembly team at the process; calculating a plurality of finishing time points of the product assembled by a plurality of assembly groups according to the earliest permitted processing time point and the assembly time length of each assembly group in the process; and selecting a first assembly team with the earliest finishing time point to assemble the product.

16. The assembly scheduling information generating system of claim 15, wherein the second obtaining module is further configured to, if there are a plurality of the first assembly groups, select a second assembly group of the first assembly groups with a shortest assembly length in the assembly process to assemble the product.

17. The assembly scheduling information generating system of claim 16 wherein the second obtaining module is further configured to determine release times of a plurality of the second assembly groups if the plurality of the second assembly groups exist; and calculating the difference between the earliest permitted processing time point of the product in the process and the release time of the plurality of second assembly groups, and selecting a third assembly group with the minimum difference to assemble the product.

18. The assembly scheduling information generating system of claim 10, wherein the second obtaining module is configured to determine a processing sequence of each product in a first process according to the product queue, and the other processes except the first process are sequentially processed according to a time sequence of in-place products.

19. An electronic device comprising a processor, a memory and a computer program stored on the memory and executable on the processor, the computer program, when executed by the processor, implementing the steps of the assembly schedule information generation method according to any one of claims 1 to 9.

20. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a computer program which, when being executed by a processor, carries out the steps of the assembly schedule information generation method according to any one of claims 1 to 9.