1. An optimal flexible scheduling method based on a dynamic information accumulation lion group is characterized by comprising the following steps:

(1) constructing a mathematical optimization model of flexible workshop scheduling by taking the highest production working hour benefit as a target, determining the optimization target as the maximum processing completion time, and determining prior parameters, wherein the method comprises the following steps: the number n of workpieces, the number m of machines, the number of processed workpieces, the number of respective processes, the number and the number of processing machines, the time for each process and the number of corresponding machines;

(2) optimizing a mathematical optimization model by using a dynamic information accumulation lion group algorithm;

initializing a lion group algorithm population, and establishing a mapping relation between population individuals and a flexible scheduling scheme;

adding an individual optimal information accumulation factor and a population optimal information accumulation factor in a population updating iteration process;

and finally, outputting the optimal position and the optimal value of the lion, wherein the optimal value is the optimized maximum processing completion time, and the optimal position is mapped and converted to obtain a processing scheduling scheme.

2. The optimal flexible scheduling method based on the dynamic information cumulative lion group as claimed in claim 1, wherein in the step (1), the mathematical optimization model of the flexible workshop scheduling is a flexible workshop scheduling model, the flexible workshop scheduling model is constructed, and key parameters are determined;

the key parameters comprise a machine sequence matrix M and a processing time matrix T, and any element M in the machine sequence matrix M_i,jA machine number indicating a j-th process for machining a workpiece i; any element T in the processing time matrix T_i,jThe processing time required by the j process of the workpiece i; both the machine sequence matrix M and the processing time matrix T are nxm matrices;

the optimization objective function of the flexible workshop scheduling model is shown as the formula (I):

in the formula (I), C_maxIs the processing completion time, C (π)_iK) represents the machining finish time of the workpiece with the number i on the machine with the number k; pi_iDenotes a workpiece, i is its number, i is 1, 2.

C(π_i,k)＝max{C(π_i-1,k),C(π_i,k-1)}+p(π_i,k),i＝2,...,n；k＝2,...,m，C(π_i-1K) is the machining completion time of the workpiece numbered i-1 on the machine numbered k, C (π_iK-1) refers to the machining finish time of the workpiece with the number i on the machine with the number k-1;

the optimization purpose of the flexible workshop scheduling model is to minimize the processing completion time: min { Cmax };

in flexible workshop scheduling, selecting machine equipment and determining a processing sequence:

determining population individuals in a double-layer gene coding mode, wherein the formula is shown as a formula (II):

D＝2×Np (Ⅱ)

in the formula (II), D represents the individual dimension of the population, and Np represents the total number of the working procedures of the workpiece.

3. The optimal flexible scheduling method based on the cumulative lion group based on the dynamic information as claimed in claim 1, wherein the specific implementation process of the step (2) includes:

A. initializing lion group population, and mapping a group individual into a scheduling scheme through a semi-activity decoding algorithm;

B. calculating the fitness value of each population individual, and initializing population individual optimal and global optimal;

C. and updating and iterating the population according to a lion-population algorithm mechanism, and adding an information accumulation factor and a dynamic adjustment learning method in iterative calculation.

4. The optimal flexible scheduling method based on the cumulative lion group based on the dynamic information as claimed in claim 3, wherein the specific implementation process of the step A includes:

defining a population of individuals X_i＝[x_i,1,x_i,2,...,x_i,n×m]A real string of length nxm;

random key coding-based LOV rule for realizing individual X from population_i＝[x_i,1,x_i,2,...,x_i,n×m]To discrete processing order piⁱ＝{π_i,1,π_i,2,...,π_i,n×mThe conversion of (5) is specifically: mixing X_i＝[x_i,1,x_i,2,...,x_i,n×m]Labeling the components in ascending order of their numerical values, the labels being integers from 1 to nxm, to obtain a middle sequence of labelsOrder to

The method for determining the scheduling scheme by mapping by adopting the semi-active decoding algorithm specifically comprises the following steps:

step 1: defining a counting variable j-1 and a counting vector k (ω) -1, ω -1, 2.. n, g (ω) -1, ω -1, 2.. m;

step 2: according to the shape of the machined workpiece_jCurrent process step k (pi)_j) Determining the corresponding machine number

And step 3: comparing the processed workpiece pi_jLast process k (pi)_j) -1 completion time t₁And a machineLast processing task ofCompletion time t₂(ii) a If k (pi)_j) When 1, then t₁0; if it isThen t₂＝0；

And 4, step 4:

and 5: let k (Pi)_j)＝k(π_j)+1，

Step 6: and j is equal to j +1, if j is equal to or less than n multiplied by m, the step 2 is switched to, and if not, the step is ended.

5. The optimal flexible scheduling method based on the cumulative lion group based on the dynamic information as claimed in claim 3, wherein the specific implementation process of step B includes: the population individuals are mapped into a scheduling scheme through the step A, the maximum completion time, namely the fitness value of the population individuals, is obtained according to the formula (I), the obtained fitness value of the population individuals, namely the fitness value of the first-generation lion population individuals, is initialized to be optimal for each population individual, and the global optimal is determined by the minimum fitness value of all the population individuals.

6. The lion group optimal flexible scheduling method based on dynamic information accumulation according to claim 1, wherein in the step C, updating iteration of the population is performed according to a lion group algorithm mechanism, and the updating iteration is as shown in formula (iii):

in the formula (III), the compound represented by the formula (III),globally optimal individual, g, of offspring obtained by updating representative lion king itself^kIs a globally optimal individual of the population of the kth generation,representing the historical optimal position of the ith individual after k iterations, wherein gamma is a random number generated according to normal distribution;

the dynamic adjustment learning method is characterized in that in the process of cooperative hunting of two lions, the influence of a better individual is enhanced through the adjustment of a weight factor, and the formula (IV) is as follows:

in the formula (IV), K is a weakening factor of (0,1), and plays a role in weakening a poorer individual and strengthening a dominant individual;representing the lion individual after the formula is updated,is the historical optimal position for the ith lion for the kth iteration,is the historical optimal position of another parent lion except the ith lion, and the disturbance factor alpha_fIt is a dynamic function of the iteration times t, which decreases with the increase of t and gradually approaches zero;

the dynamic adjustment and selection of the judgment condition in the formula (IV) mean that: first comparisonAndthe adaptive value of (1) adding a weakening factor K to the position with larger adaptive value to weaken the influence weight of the individual with poorer position and strengthen the influence weight of the individual with better position;

the information accumulation factors comprise individual information accumulation factors and global information accumulation factors, and the individual information accumulation factor C_pAnd a global information accumulation factor C_gRespectively shown in formula (V) and formula (VI):

in the formulae (V) and (VI), p_iRefers to the historical optimal position, p, of the ith individual_gIs the whole seedGlobal optimal position of the cluster, k being the current iteration number;

the updating iteration after adding the information accumulation factor and dynamically adjusting the learning method is shown as the formula (VII):

7. the optimal flexible scheduling method based on the cumulative lion group based on the dynamic information as claimed in claim 3, wherein the specific implementation process of step C includes:

1) calculating the fitness value of the new population individuals, and updating the individual optimal value and the global optimal value; the method comprises the following steps:representing the lion individual after the updating of the formula (VII),is the historical optimal position of the ith lion at the kth iteration, if:then orderThis is optimal for new individuals; if present: p is a radical of_g ^k+1＝{p_i ^k+1|min{f(p_i ^k+1)，i＝1，2，...}}，p_g ^k+1Is a new global optimum;

2) updating the individual information accumulation factor and the global information accumulation factor according to the new individual optimal value and the global optimal value, wherein the updating means that: new individual optimum value p_iAnd a new global optimum p_gCarrying in formula (V) or formula (VI), calculating new C_pAnd C_g；

3) Judging whether an iteration stop condition is reached, if so, performing a step 4); otherwise, returning to the step 1); the iteration times reach a preset maximum value T;

4) outputting the optimized scheduling scheme and the target function value, namely the time for finishing the processing; the method comprises the following steps: outputting p obtained by the last iteration_gAnd mapping the data to be a scheduling scheme through a semi-active decoding algorithm, namely the optimized scheduling scheme, wherein the processing completion time of the scheduling scheme is an objective function value.

8. The optimal flexible scheduling system based on the dynamic information cumulative lion group is characterized by being used for realizing the optimal flexible scheduling method based on the dynamic information cumulative lion group, which is disclosed by any one of claims 1-7, and comprises a mathematical optimization model building unit and a mathematical optimization model optimizing unit; the mathematical optimization model building unit is used for realizing the step (1), and the mathematical optimization model optimization unit is used for realizing the step (2).

Background

Production scheduling problems are widely present in the field of industrial production, especially in various manufacturing enterprises. The research on scheduling problems for industrial production has mainly focused on the use and allocation of production resources. Generally speaking, for different types and requirements of production and processing tasks, corresponding production scheduling schemes and plans need to be established. The planning will typically be based on one or more optimization objectives, such as: production time, machine energy consumption, machine utilization, and the like.

With advances in technology level and industrial productivity, the scheduling problem becomes more complex and scalable. From the simple replacement pipeline scheduling problem, to the workshop production scheduling problem, to the flexible scheduling problem, and even scheduling problems of various specific limiting conditions and requirements are continuously provided. Moreover, the shop scheduling problem has proven to be an NP-hard problem, and finding its optimal solution is difficult. This places high demands and severe demands on the solution to such problems.

Due to the reasons that the traditional mathematical programming algorithm is high in computational complexity, low in robustness, high in requirements on constraint conditions of scheduling problems and the like, a satisfactory solution is often difficult to obtain when a large-scale scheduling problem is solved.

Under the circumstance, the lion group optimization algorithm is one of the latest group intelligent optimization algorithms and is also a meta-heuristic algorithm, and is more and more concerned by the field of industrial production scheduling. Because the method has the advantages of high efficiency, intelligence, universality, good robustness and strong adaptability, the method gradually becomes a new effective method for solving the scheduling problem. The method has the advantages of simple structure, high convergence speed and good diversity, and is an excellent optimization algorithm. Currently, the lion group algorithm has certain problems, such as being easy to fall into local extrema, and has larger improvement space and development potential.

Disclosure of Invention

Aiming at the defects of the prior art, the invention provides an optimal flexible scheduling method based on a dynamic information accumulation lion group. By adding accumulated information of historical time sequence in an iterative updating mechanism of a lion group algorithm, the adopted measures are helpful for thoroughly searching the whole problem optimization space, finding out a global optimal solution and effectively avoiding reducing the situation of falling into local optimal.

The invention also provides an optimal flexible scheduling system based on the dynamic information accumulated lion group.

Interpretation of terms:

1. the group intelligent algorithm is a new evolutionary computing technology inspired by natural biological groups, and the hunting process that the spiritual feeling and the theoretical source are the mutual cooperation and the joint cooperation of lion groups in the nature. The method is further provided by observing and analyzing the composition and the behavior activities of the lion group.

2. The lion group is divided into three groups, namely a lion king, a female lion and a young lion, and the whole lion group is clear in division of labor in hunting. The lion group optimization algorithm has the main idea that a lion with the optimal objective function value, namely the optimal fitness value is determined as a lion king from a certain initial position in an area to be optimized, then a female lion is determined according to a certain proportion, and the female lion is matched with the female lion for optimizing and hunting. If a position is found that is superior to the current lion king position, the position will be owned by the lion king. The young lion moves along with the mother lion to learn hunting, or moves and eats near the king of the lion, and is driven out of the lion group after adult. The whole lion group works in a dividing and cooperation mode, and the optimal value of the objective function is obtained by continuously and repeatedly searching according to own responsibility.

3. Population individual, now assume an optimization problem f (x), whose solution space dimension is D. The number of lion groups is N. Each lion of a group of lions may be represented by a D-dimensional vector. x is the number of_i＝(x_i1,x_i2,...,x_iD),1≤i≤N。

The technical scheme of the invention is as follows:

an optimal flexible scheduling method based on a dynamic information accumulation lion group comprises the following steps:

(1) constructing a mathematical optimization model of flexible workshop scheduling by taking the highest production working hour benefit as a target, determining the optimization target as the maximum processing completion time, and determining prior parameters, wherein the method comprises the following steps: the number n of workpieces, the number m of machines, the number of processed workpieces, the number of respective processes, the number and the number of processing machines, the time for each process and the number of corresponding machines;

(2) optimizing a mathematical optimization model by using a dynamic information accumulation lion group algorithm;

initializing a lion group algorithm population, and establishing a mapping relation between population individuals and a flexible scheduling scheme;

adding an individual optimal information accumulation factor and a population optimal information accumulation factor in a population updating iteration process; two degrees of freedom are added on the original basis, so that the diversity of individual movement directions is increased, and the whole problem optimizing space can be thoroughly explored.

And finally, outputting the optimal position and the optimal value of the lion, wherein the optimal value is the optimized maximum processing completion time, and the optimal position is mapped and converted to obtain a processing scheduling scheme.

According to the optimization method, in the step (1), a mathematical optimization model of flexible workshop scheduling is a flexible workshop scheduling model, the flexible workshop scheduling model is constructed, and key parameters are determined;

the key parameters comprise a machine sequence matrix M and a processing time matrix T, and any element M in the machine sequence matrix M_i,jA machine number indicating a j-th process for machining a workpiece i; any element T in the processing time matrix T_i,jThe processing time required by the j process of the workpiece i; both the machine sequence matrix M and the processing time matrix T are nxm matrices;

the optimization objective function of the flexible workshop scheduling model is shown as the formula (I):

in the formula (I), C_maxIs the processing completion time, C (π)_iK) represents the machining finish time of the workpiece with the number i on the machine with the number k; pi_iDenotes a workpiece, i is its number, i is 1, 2.

C(π_i,k)＝max{C(π_i-1,k),C(π_i,k-1)}+p(π_i,k),i＝2,...,n；k＝2,...,m，C(π_i-1K) is the machining completion time of the workpiece numbered i-1 on the machine numbered k, C (π_iK-1) refers to the machining finish time of the workpiece with the number i on the machine with the number k-1;

the optimization purpose of the flexible workshop scheduling model is to minimize the processing completion time: min { Cmax };

in the method, the two steps of machine equipment selection and processing sequence determination in flexible workshop scheduling are combined into one step, so that the population individual needs to be determined in a double-layer gene coding mode.

In flexible workshop scheduling, selecting machine equipment and determining a processing sequence:

determining population individuals in a double-layer gene coding mode, wherein the formula is shown as a formula (II):

D＝2×Np (Ⅱ)

in the formula (II), D refers to the individual dimension of the population, and Np refers to the total number of the working procedures of the workpiece;

in the present invention, the prior parameters of the number of workpieces and processes to be processed, the number of machines to be processed, and the number of processes are from the family of the FJSP standard arithmetic model brandimart _ MK. In actual production, the workpieces to be processed need to be sequentially subjected to step decomposition according to the process time, and the steps are confirmed one by one.

According to the invention, the specific implementation process of the step (2) comprises the following steps:

A. initializing lion group population, and mapping a group individual into a scheduling scheme through a semi-activity decoding algorithm;

B. calculating the fitness value of each population individual, and initializing population individual optimal and global optimal;

C. and updating and iterating the population according to a lion-population algorithm mechanism, and adding an information accumulation factor and a dynamic adjustment learning method in iterative calculation.

According to the invention, the specific implementation process of the step a preferably comprises the following steps:

defining a population of individuals X_i＝[x_i,1,x_i,2,...,x_i,n×m]A real string of length nxm;

random key coding-based LOV (large-order-value) rule is utilized to realize individual X from population_i＝[x_i,1,x_i,2,...,x_i,n×m]To discrete processing order piⁱ＝{π_i,1,π_i,2,...,π_i,n×mThe conversion of (5) is specifically: mixing X_i＝[x_i,1,x_i,2,...,x_i,n×m]Labeling the components in ascending order of their numerical values, the labels being integers from 1 to nxm, to obtain a middle sequence of labelsOrder to

The method for determining the scheduling scheme by mapping by adopting the semi-active decoding algorithm specifically comprises the following steps:

step 1: defining a counting variable j-1 and a counting vector k (ω) -1, ω -1, 2.. n, g (ω) -1, ω -1, 2.. m;

step 2: according to the shape of the machined workpiece_jCurrent process step k (pi)_j) Determining the corresponding machine number

And step 3: comparing the processed workpiece pi_jLast process k (pi)_j) -1 completion time t₁And a machineLast processing task ofCompletion time t₂(ii) a If k (pi)_j) When 1, then t₁0; if it isThen t₂＝0；

And 4, step 4:

and 5:let k (Pi)_j)＝k(π_j)+1，

Step 6: and j is equal to j +1, if j is equal to or less than n multiplied by m, the step 2 is switched to, and if not, the step is ended.

According to the invention, the specific implementation process of the step B comprises the following steps: the population individuals are mapped into a scheduling scheme through the step A, the maximum completion time, namely the fitness value of the population individuals, is obtained according to the formula (I), the obtained fitness value of the population individuals, namely the fitness value of the first-generation lion population individuals, is initialized to be optimal for each population individual, and the global optimal is determined by the minimum fitness value of all the population individuals.

Preferably, in step C, updating iteration of the population is performed according to the mechanism of the lion group algorithm, and the updating iteration is shown as formula (iii):

in the formula (III), the compound represented by the formula (III),globally optimal individual, g, of offspring obtained by updating representative lion king itself^kIs a globally optimal individual of the population of the kth generation,representing the historical optimal position of the ith individual after k iterations, wherein gamma is a random number generated according to normal distribution;

the dynamic adjustment learning method is characterized in that in the process of cooperative hunting of two lions, the influence of a better individual is enhanced through the adjustment of a weight factor, and the formula (IV) is as follows:

in the formula (IV), K is (0,1)Attenuation factors, which act to attenuate poorer individuals and enhance dominant individuals;representing the lion individual after the formula is updated,is the historical optimal position for the ith lion for the kth iteration,is the historical optimal position of another parent lion except the ith lion, and the disturbance factor alpha_fIt is a dynamic function of the iteration times t, which decreases with the increase of t and gradually approaches zero;

the dynamic adjustment and selection of the judgment condition in the formula (IV) mean that: first comparisonAndthe adaptive value of (1) adds a weakening factor K to the position with larger adaptive value (namely, the position far away from the optimal value) to weaken the influence weight of the individual with poorer position and strengthen the influence weight of the individual with better position;

the information accumulation factors comprise individual information accumulation factors and global information accumulation factors, and the individual information accumulation factor C_pAnd a global information accumulation factor C_gRespectively shown in formula (V) and formula (VI):

in the formulae (V) and (VI), p_iRefers to the historical optimal position, p, of the ith individual_gIs the global optimum position of the whole population, and k is the current iteration number;

the updating iteration after adding the information accumulation factor and dynamically adjusting the learning method is shown as the formula (VII):

according to the invention, the specific implementation process of the step C comprises the following steps:

1) calculating the fitness value of the new population individuals, and updating the individual optimal value and the global optimal value; the method comprises the following steps:representing the lion individual after the updating of the formula (VII),is the historical optimal position of the ith lion at the kth iteration, if:then orderThis is optimal for new individuals; if present:p_g ^k+1is a new global optimum.

2) Updating the individual information accumulation factor and the global information accumulation factor according to the new individual optimal value and the global optimal value, wherein the updating means that: new individual optimum value p_iAnd a new global optimum p_gCarrying in formula (V) or formula (VI), calculating new C_pAnd C_g；

3) Judging whether an iteration stop condition is reached, if so, performing a step 4); otherwise, returning to the step 1); the iteration times reach a preset maximum value T;

4) outputting optimized scheduling scheme and objective function value (when processing is finished)) (ii) a The method comprises the following steps: outputting p obtained by the last iteration_gAnd mapping the data to be a scheduling scheme through a semi-active decoding algorithm, namely the optimized scheduling scheme, wherein the processing completion time of the scheduling scheme is an objective function value.

A lion group optimal flexible scheduling system based on dynamic information accumulation is used for realizing a lion group optimal flexible scheduling method based on dynamic information accumulation, and comprises a mathematical optimization model building unit and a mathematical optimization model optimizing unit; the mathematical optimization model building unit is used for realizing the step (1), and the mathematical optimization model optimization unit is used for realizing the step (2).

The invention has the beneficial effects that:

when the related flexible scheduling problem is processed, the method uses a novel dynamic information accumulation lion group optimization algorithm, a scheduling scheme with shorter time can be obtained, the production time is saved, the production efficiency is improved, and meanwhile, the algorithm has good adaptability and robustness to different types of scheduling problems.

Drawings

FIG. 1 is a schematic block diagram of a flow of an optimal flexible scheduling method based on a dynamic information accumulation lion group according to the present invention;

Detailed Description

The invention is further described below, but not limited to, with reference to the following figures and examples.

Example 1

An optimal flexible scheduling method based on a dynamic information accumulation lion group is shown in fig. 1, and comprises the following steps:

(1) constructing a mathematical optimization model of flexible workshop scheduling by taking the highest production working hour benefit as a target, determining the optimization target as the maximum processing completion time, and determining prior parameters, wherein the method comprises the following steps: the number n of workpieces, the number m of machines, the number of processed workpieces, the number of respective processes, the number and the number of processing machines, the time for each process and the number of corresponding machines;

(2) optimizing a mathematical optimization model by using a dynamic information accumulation lion group algorithm;

initializing a lion group algorithm population, and establishing a mapping relation between population individuals and a flexible scheduling scheme;

adding an individual optimal information accumulation factor and a population optimal information accumulation factor in a population updating iteration process; two degrees of freedom are added on the original basis, so that the diversity of individual movement directions is increased, and the whole problem optimizing space can be thoroughly explored.

And finally, outputting the optimal position and the optimal value of the lion, wherein the optimal value is the optimized maximum processing completion time, and the optimal position is mapped and converted to obtain a processing scheduling scheme.

Example 2

The optimal flexible scheduling method based on the dynamic information cumulative lion group in the embodiment 1 is characterized in that:

in the step (1), a mathematical optimization model of flexible workshop scheduling is a flexible workshop scheduling model, a flexible workshop scheduling model is constructed, and key parameters are determined;

the key parameters comprise a machine sequence matrix M and a processing time matrix T, and any element M in the machine sequence matrix M_i,jA machine number indicating a j-th process for machining a workpiece i; any element T in the processing time matrix T_i,jThe processing time required by the j process of the workpiece i; both the machine sequence matrix M and the processing time matrix T are nxm matrices;

the optimization objective function of the flexible workshop scheduling model is shown as the formula (I):

in the formula (I), C_maxIs the processing completion time, C (π)_iK) represents the machining finish time of the workpiece with the number i on the machine with the number k; pi_iDenotes a workpiece, i is its number, i is 1, 2.

C(π_i,k)＝max{C(π_i-1,k),C(π_i,k-1)}+p(π_i,k),i＝2,...,n；k＝2,...,m，C(π_i-1K) is the machining completion time of the workpiece numbered i-1 on the machine numbered k, C (π_iK-1) refers to the machining finish time of the workpiece with the number i on the machine with the number k-1;

the optimization purpose of the flexible workshop scheduling model is to minimize the processing completion time: min { Cmax };

in the method, the two steps of machine equipment selection and processing sequence determination in flexible workshop scheduling are combined into one step, so that the population individual needs to be determined in a double-layer gene coding mode.

In flexible workshop scheduling, selecting machine equipment and determining a processing sequence:

determining population individuals in a double-layer gene coding mode, wherein the formula is shown as a formula (II):

D＝2×Np (Ⅱ)

in the formula (II), D refers to the individual dimension of the population, and Np refers to the total number of the working procedures of the workpiece;

in the present invention, the prior parameters of the number of workpieces and processes to be processed, the number of machines to be processed, and the number of processes are from the family of the FJSP standard arithmetic model brandimart _ MK. In actual production, the workpieces to be processed need to be sequentially subjected to step decomposition according to the process time, and the steps are confirmed one by one.

The specific implementation process of the step (2) comprises the following steps:

A. initializing lion group population, and mapping a group individual into a scheduling scheme through a semi-activity decoding algorithm;

B. calculating the fitness value of each population individual, and initializing population individual optimal and global optimal;

C. and updating and iterating the population according to a lion-population algorithm mechanism, and adding an information accumulation factor and a dynamic adjustment learning method in iterative calculation.

The specific implementation process of the step A comprises the following steps:

defining a population of individuals X_i＝[x_i,1,x_i,2,...,x_i,n×m]A real string of length nxm;

random key coding-based LOV (large-order-value) rule is utilized to realize individual X from population_i＝[x_i,1,x_i,2,...,x_i,n×m]To discrete additionI-order piⁱ＝{π_i,1,π_i,2,...,π_i,n×mThe conversion of (5) is specifically: mixing X_i＝[x_i,1,x_i,2,...,x_i,n×m]Labeling the components in ascending order of their numerical values, the labels being integers from 1 to nxm, to obtain a middle sequence of labelsOrder to

The method for determining the scheduling scheme by mapping by adopting the semi-active decoding algorithm specifically comprises the following steps:

step 1: defining a counting variable j-1 and a counting vector k (ω) -1, ω -1, 2.. n, g (ω) -1, ω -1, 2.. m;

step 2: according to the shape of the machined workpiece_jCurrent process step k (pi)_j) Determining the corresponding machine number

And step 3: comparing the processed workpiece pi_jLast process k (pi)_j) -1 completion time t₁And a machineLast processing task ofCompletion time t₂(ii) a If k (pi)_j) When 1, then t₁0; if it isThen t₂＝0；

And 4, step 4:

and 5: let k (Pi)_j)＝k(π_j)+1，

Step 6: and j is equal to j +1, if j is equal to or less than n multiplied by m, the step 2 is switched to, and if not, the step is ended.

The concrete implementation process of the step B comprises the following steps: the population individuals are mapped into a scheduling scheme through the step A, the maximum completion time, namely the fitness value of the population individuals, is obtained according to the formula (I), the obtained fitness value of the population individuals, namely the fitness value of the first-generation lion population individuals, is initialized to be optimal for each population individual, and the global optimal is determined by the minimum fitness value of all the population individuals.

In the step C, updating iteration of the population is carried out according to a lion group algorithm mechanism, and the updating iteration is shown as a formula (III):

in the formula (III), the compound represented by the formula (III),globally optimal individual, g, of offspring obtained by updating representative lion king itself^kIs a globally optimal individual of the population of the kth generation,representing the historical optimal position of the ith individual after k iterations, wherein gamma is a random number generated according to normal distribution;

the dynamic adjustment learning method is characterized in that in the process of cooperative hunting of two lions, the influence of a better individual is enhanced through the adjustment of a weight factor, and the formula (IV) is as follows:

in the formula (IV), K is a weakening factor of (0,1), and plays a role in weakening a poorer individual and strengthening a dominant individual;representing the lion individual after the formula is updated,is the historical optimal position for the ith lion for the kth iteration,is the historical optimal position of another parent lion except the ith lion, and the disturbance factor alpha_fIt is a dynamic function of the iteration times t, which decreases with the increase of t and gradually approaches zero;

the dynamic adjustment and selection of the judgment condition in the formula (IV) mean that: first comparisonAndthe adaptive value of (1) adds a weakening factor K to the position with larger adaptive value (namely, the position far away from the optimal value) to weaken the influence weight of the individual with poorer position and strengthen the influence weight of the individual with better position;

the information accumulation factors comprise individual information accumulation factors and global information accumulation factors, and the individual information accumulation factor C_pAnd a global information accumulation factor C_gRespectively shown in formula (V) and formula (VI):

in the formulae (V) and (VI), p_iRefers to the historical optimal position, p, of the ith individual_gIs the global optimum position of the whole population, and k is the current iteration number;

the updating iteration after adding the information accumulation factor and dynamically adjusting the learning method is shown as the formula (VII):

the concrete implementation process of the step C comprises the following steps:

1) calculating the fitness value of the new population individuals, and updating the individual optimal value and the global optimal value; the method comprises the following steps:representing the lion individual after the updating of the formula (VII),is the historical optimal position of the ith lion at the kth iteration, if:then orderThis is optimal for new individuals; if present:p_g ^k+1is a new global optimum.

2) Updating the individual information accumulation factor and the global information accumulation factor according to the new individual optimal value and the global optimal value, wherein the updating means that: new individual optimum value p_iAnd a new global optimum p_gCarrying in formula (V) or formula (VI), calculating new C_pAnd C_g；

3) Judging whether an iteration stop condition is reached, if so, performing a step 4); otherwise, returning to the step 1); the iteration times reach a preset maximum value T;

4) outputting the optimized scheduling scheme and the objective function value (when the processing is finished); the method comprises the following steps: outputting p obtained by the last iteration_gMapping to a scheduling scheme, i.e. optimization, by a semi-active decoding algorithmIn the subsequent scheduling scheme, the processing completion time of the scheduling scheme is the objective function value.

Table 1 compares the optimization results of the conventional planning algorithm and the optimal flexible scheduling method based on the dynamic information accumulation lion group on the three standard examples of mk series. The table counts the test data of 20 replicates and analyses were performed.

TABLE 1

The results show that on the example models, the method of the invention is improved in various performances compared with the traditional algorithm. The optimal flexible scheduling method based on the dynamic information accumulation lion group is superior to the scheduling problem.

Example 3

A lion group optimal flexible scheduling system based on dynamic information accumulation is used for realizing the lion group optimal flexible scheduling method based on dynamic information accumulation in the embodiment 1 or 2, and comprises a mathematical optimization model building unit and a mathematical optimization model optimizing unit; and the mathematical optimization model building unit is used for realizing the step (1), and the mathematical optimization model optimizing unit is used for realizing the step (2).