Flexible job shop batch flow scheduling method with topological neighborhood structure

Through topological neighborhood structure and three-dimensional graph coding model, combined with floating time method and topological sorting, the problem of high computational complexity in batch flow scheduling in flexible work workshops is solved, efficient and stable scheduling optimization is achieved, and the infeasibility is avoided The generation of solutions improves the solution efficiency and quality of batch flow scheduling in flexible operation workshops.

CN119065329AActive Publication Date: 2024-12-03HUAZHONG UNIV OF SCI & TECH
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202411130160.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-16
Publication Date
2024-12-03
Estimated Expiration
2044-08-16

AI Technical Summary

Technical Problem

The existing neighborhood structure has high computational complexity and huge solution space in the batch flow scheduling problem of flexible work workshops, resulting in low solution efficiency and unstable output solution quality, and easy to produce infeasible solutions.

Method used

A flexible work workshop batch flow scheduling method with topological neighborhood structure was designed. Through three-dimensional dissection graph coding model and topological sorting decoding, combining floating time method and two neighborhood perturbation operations, it avoids the generation of illegal solutions and ensures high efficiency and feasibility. scheduling plan.

Benefits of technology

It reduces computing resource consumption, improves the search performance of the solution algorithm, ensures high-quality neighborhood solutions, reduces the probability of infeasible solutions, and improves the scheduling optimization effect.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119065329A_ABST
    Figure CN119065329A_ABST
Patent Text Reader

Abstract

The invention belongs to the related technical field of scheduling theories in a workshop manufacturing process, and discloses a flexible job shop batch flow scheduling method with a topological neighborhood structure, and the method comprises the steps: building a three-dimensional disjunction graph coding model of a flexible job shop batch flow scheduling problem, and carrying out the batch flow scheduling of the flexible job shop according to the high-dimensional complex features of a three-dimensional disjunction graph; a fast decoding method based on topological sorting is designed, a high-dimensional and complex space diagram of flexible job shop batch flow scheduling is converted into an expression form of a linear topological chain table, a key path judgment method is designed in combination with a floating time method, decoding time consumption is reduced, and for key nodes on key paths, decoding efficiency is improved. Two neighborhood disturbance operations in the designed topological neighborhood structure are utilized to efficiently and stably output a feasible neighborhood solution, high-quality disturbance of the neighborhood is effectively carried out in a short time, generation of an infeasible solution is avoided, calculation resource consumption of subsequent feasibility judgment is further reduced, and the search performance of a solution algorithm is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field related to scheduling theory in workshop manufacturing processes, and more specifically, relates to a flexible job shop batch flow scheduling method with a topological neighborhood structure. Background Art

[0002] Neighborhood structure plays a key role in the field of job shop scheduling. As an important component of the optimization algorithm, the neighborhood structure can find a better scheduling solution by efficiently exploring different areas of the solution space. In the job shop scheduling problem, the reasonable design and application of the neighborhood structure can effectively improve the algorithm's search efficiency and problem-solving ability. Guided by the neighborhood structure, the optimization algorithm can quickly jump out of the local optimum and find the global optimal solution, thereby improving scheduling efficiency and production benefits.

[0003] Most of the existing neighborhood structures are aimed at flexible job shop scheduling problems, and have the following problems: First, the existing neighborhood structures need to strictly consider the process sequence constraints between nodes when perturbing nodes on the critical path, and determine the insertion position by calculating the head time and tail time. In these steps, the algorithm needs to consume a lot of resources for calculation and judgment to ensure that the generated solution meets all constraints; secondly, the existing neighborhood structure has a certain probability of generating infeasible solutions during the optimization process, and the feasibility judgment will also consume a lot of computing resources, and the generation of infeasible solutions will also cause the algorithm to fall into invalid search.

[0004] Unlike the traditional flexible job shop scheduling problem, the flexible job shop batch flow scheduling problem is that there are multiple batch manufacturing tasks in the flexible job shop, and these tasks need to be processed on multiple machines. The flexible job shop batch flow scheduling problem also needs to consider the characteristics of batch flow. Most of the existing neighborhood structures are based on two-dimensional disjunctive graph encoding, and the process is used as a node to move the position to generate a neighborhood solution. However, in the flexible job batch flow scheduling problem, sub-batches are used as nodes in the disjunctive graph, and each node has three attributes: product number, process number, and sub-batch number. This high-dimensional and complex constraint further increases the difficulty of node movement and the probability of generating infeasible solutions after movement, resulting in a further increase in the complexity of the solution, the solution space is too large and complex, the solution efficiency is low, and the output solution quality is unstable. The existing neighborhood structure will no longer be applicable.

[0005] Therefore, considering the characteristics of the flexible job shop batch flow scheduling problem, it is urgent to design a flexible job shop batch flow scheduling method with a topological neighborhood structure to reduce the computational complexity while ensuring the quality and feasibility of the neighborhood solution, thereby improving the scheduling optimization effect. Summary of the invention

[0006] In response to the above defects or improvement needs of the prior art, the present invention provides a flexible job shop batch flow scheduling method with a topological neighborhood structure to solve the technical problems of low solution efficiency and high consumption of computing resources. It can avoid the generation of illegal neighborhood solutions and stably and efficiently obtain excellent neighborhood solutions to the flexible job shop batch flow scheduling problem.

[0007] To achieve the above object, according to one aspect of the present invention, a flexible job shop batch flow scheduling method with a topological neighborhood structure is provided, comprising the following steps:

[0008] S1: Population initialization, taking the flexible job shop batch flow scheduling solution to be optimized as the initial solution;

[0009] S2: Establish a three-dimensional disjunctive graph encoding model for the flexible job shop batch flow scheduling problem. The initial solution in S1 is expressed through a three-dimensional disjunctive graph, and the optimization goal is to minimize the maximum completion time.

[0010] S3: Based on the three-dimensional disjunctive graph encoding model in S2, topological sorting decoding is performed to obtain a one-dimensional topological linked list;

[0011] S4: Use the floating time method to identify the critical path. Based on the topological linked list in step S3, traverse each sub-batch node in the linear topological linked list in a linear order, insert the node with a floating time of 0 into the set, and form a critical path;

[0012] S5: For each key node on the critical path, a topological neighborhood structure is used to obtain a neighborhood solution; the topological neighborhood structure includes two neighborhood perturbation operations: the neighborhood perturbation operation TNS-1 is set to move the key nodes on the same machine, and the neighborhood perturbation operation TNS-2 is set to move the key nodes across machines;

[0013] S6: Calculate the maximum completion time, and select the one with the smallest maximum completion time from the neighborhood solutions as the new optimal solution. When the maximum completion time of the optimal solution is better than the initial solution, replace the initial solution with the optimal solution to update the population and determine whether the termination condition is met. If so, output the optimal solution. If not, go to step S1.

[0014] Furthermore, in step S2, the three-dimensional disjunctive graph encoding model maps the product number, process number and sub-batch number corresponding to each sub-batch in the flexible job batch flow scheduling to the product axis, process axis and sub-batch axis respectively; each coordinate position in the three-dimensional disjunctive graph encoding model represents a sub-batch node, and the sub-batch nodes are connected by product arcs, sub-batch arcs and machine arcs. The product arc is the process sequence constraint arc between the previous and next processes, the sub-batch arc is the virtual arc between the sub-batch nodes of the same process, and the machine arc is the connection arc between the previous and next tasks on the same machine.

[0015] Furthermore, in step S3, the specific steps of topological sorting decoding are: create a new empty topological linked list, starting from the starting node, calculate the in-degree of all nodes, put a node V among all nodes with in-degree 0 into the topological linked list, and reduce the in-degree of all adjacent nodes by 1, and repeat this cycle. As long as it is determined that there is a node with in-degree 0, it will be placed in the topological linked list until all nodes have been placed. At this time, the order of the topological linked list is the order of the nodes after topological sorting, and there will be no situation where a node with a larger index points to a node with a smaller index between any two nodes in the topological linked list.

[0016] Furthermore, the calculation process of the floating time in step S4 is:

[0017] According to the directional relationship between the connecting arcs of each node in the topological linked list, starting from the starting node, recursively calculate the earliest start time ES of each sub-batch node j,o,s,m After recursively reaching the termination node, reverse recursion is used to calculate the latest start time LS of each sub-batch node j,o,s,m , the calculation formulas for the earliest start time and the latest start time are as follows:

[0018]

[0019]

[0020] in, Represents the sub-batch node SL j,o,s,m The earliest start time of the preceding node, Represents the sub-batch node SL j,o,s,m The latest start time of the subsequent nodes, Represents the sub-batch node SL j,o,s,m The processing time of the preceding node, TC j,o,s,m Represents the sub-batch node SL j,o,s,m The processing time;

[0021] The earliest start time ES based on each sub-batch node j,o,s,m and the latest start time LS j,o,s,m , calculate the floating time TF j,o,s,m , the calculation formula is as follows:

[0022] TF j,o,s,m =LS j,o,s,m -ES j,o,s,m .

[0023] Furthermore, step S5 specifically includes the following steps:

[0024] S51: Selection of neighborhood perturbation operation: a randomly generated probability value P is used to determine which neighborhood perturbation operation is performed on the basis of the current solution to generate a new solution. If P>0.5, the neighborhood perturbation operation TNS-1 is selected, otherwise the neighborhood perturbation operation TNS-2 is selected.

[0025] S52: feasibility determination of the neighborhood disturbance operation, based on the neighborhood disturbance operation selected in S51, and according to the determination theorem, a feasibility determination is performed, wherein the determination theorem is set as follows:

[0026] Neighborhood perturbation operation TNS-1 corresponding to the judgment theorem 1: sub-batch S and For two nodes in the key block, only when When the constraint condition is After moving to node S, a loop-free feasible solution can be generated; where Index represents the index position of the node in the topological linked list, S JP and S JS They represent the previous node and the next node of node S in the process constraint, respectively. MP and S MS They represent the immediate preceding node and the immediate following node of node S in the machine task order constraint, respectively. and Respectively represent nodes The previous and next nodes on the process constraints, and Respectively represent nodes The immediate preceding node and the immediate succeeding node on the machine task order constraint;

[0027] Theorem 2 corresponding to the neighborhood perturbation operation TNS-2: If you want to move node S to machine M', you need to find the previous node S that is also on machine M'. M’P and the next node S M’S , and ensure that the position index in the topological linked list satisfies Index(S M ’P ) <Index(S),Index(S)<Index(S M’S ), then move node S to machine M' and insert it into node S M’P and S M’S There will be no infeasible solutions with cycles;

[0028] S53: Execution of neighborhood perturbation operation. When the determination theorem is not satisfied, the position of the key node is kept unchanged. When the determination theorem is satisfied, the neighborhood perturbation operation is executed, the position of the key node is exchanged, and a new neighborhood solution is generated.

[0029] Among them, the specific execution process of the neighborhood perturbation operation is:

[0030] Neighborhood perturbation operation TNS-1: Determine the key node S to be moved i and its key blocks {S1,S2,…,S i ,…,S n}, on this basis, find the key node S i The first node S of the key block processed by the same machine f and block tail node S l , and their sequence indexes on the topological linked list are marked as Index(S f ), Index(S i ), Index(S l ), and the node that swaps positions with it is determined based on a certain random probability. f Or the block tail node S l , use the determination theorem 1 to determine the index positions of the two nodes to be exchanged in the topological linked list, and exchange them under the premise of satisfying the constraints to generate a neighborhood solution;

[0031] Neighborhood perturbation operation TNS-2: Determine the key node S to be moved i and its processing machine M, and determine the new processing machine M' that needs to be moved to. On this basis, find the processing machine M' that belongs to the processing machine and is connected to the key node S in the topological linked list. i The closest preceding node S M’P and the next node S M’S , disconnect the key node S in the original topology list i The associated machine arc, originally S MP →S i →S MS , after disconnection, it is S MP →S MS , separate the key node S i The arc is broken and reconnected on the new processing machine M' to form a new complete topological chain list. The original S M ' P →S M ' S , after reconnection, it is S M ' P →S i →S M ' S , which can generate feasible new neighborhood solutions under the premise of ensuring the sufficiency of perturbations.

[0032] Furthermore, the maximum completion time c max The calculation formula is as follows:

[0033] c max =Max(c j,o,s,m ) o∈{1,2,...,O j}; s∈{1,2,...,N jo}; m∈{1,2,...,M}

[0034] In the formula, j is the subscript of the product, and its range is j = 1, 2, ..., J, J is the total number of products; o is the subscript of the process corresponding to product j, and its range is o = 1, 2, ..., O j , O j is the total number of processes for the product; s is the subscript of the subbatch, ranging from s = 0, 1, ..., sn j,o , where sn j,o Representative process O j,o The number of sub-batches divided; m is the subscript of the machine, ranging from m = 0, 1, ..., M, where M is the total number of machines; c j,o,s,m Representative process O j,o The corresponding s-th sub-batch SL j,o,s The completion time on machine m.

[0035] Furthermore, in step S6, the termination condition is that the number of iterations reaches a predetermined value.

[0036] The present invention also provides a computer-readable storage medium, in which a computer program is stored. When the computer program is run on a computer, the computer executes the flexible job shop batch flow scheduling method with a topological neighborhood structure.

[0037] The present invention also provides an electronic device, which includes a processor and a memory, wherein a computer program is stored in the memory, and the processor is used to execute the flexible job shop batch flow scheduling method with a topological neighborhood structure by calling the computer program stored in the memory.

[0038] In general, compared with the prior art, the above technical solution conceived by the present invention provides a flexible job shop batch flow scheduling method with a topological neighborhood structure, which mainly has the following beneficial effects:

[0039] 1. Based on the topological linked list and the identified critical path, a topological neighborhood structure containing two neighborhood perturbation operations is designed, which can quickly and effectively perform high-quality neighborhood perturbations in a short time and avoid the generation of infeasible solutions, thereby reducing the computing resource consumption of subsequent feasibility judgments and improving the search performance of the solution algorithm.

[0040] 2. Aiming at the characteristics of batch flow scheduling problems in flexible job shops, a three-dimensional disjunctive graph encoding model is established. Combining the characteristics of nodes, connecting arcs, and non-connecting arcs, the scheduling scheme is fully and completely characterized, and the processing sequence and process sequence of all sub-batch nodes are clearly and intuitively reflected, providing a technical basis for high-quality neighborhood disturbance.

[0041] 3. According to the high-dimensional and complex characteristics of the three-dimensional disjunctive graph, a fast decoding method based on topological sorting is designed to transform the high-dimensional and complex spatial graph of batch flow scheduling in flexible job shops into the expression of a linear topological linked list. The critical path determination method is designed in combination with the floating time method to reduce the decoding time. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1 It is a flow chart of a flexible job shop batch flow scheduling method with a topological neighborhood structure provided by the present invention;

[0043] Figure 2 It is a three-dimensional disjunctive graph coding model and a topological sorting schematic diagram of the present invention;

[0044] Figure 3 It is a schematic diagram of the neighborhood disturbance operation TNS-1 of the present invention; Figure 3 (a) is a schematic diagram of generating feasible solutions by perturbation within a topological block. Figure 3 (b) is a schematic diagram of the generation of infeasible solutions by perturbations within a topological block;

[0045] Figure 4 It is a schematic diagram of the neighborhood disturbance operation TNS-2 of the present invention. DETAILED DESCRIPTION

[0046] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0047] See also Figure 1 The present invention proposes a flexible job shop batch flow scheduling method with a topological neighborhood structure. The method establishes a three-dimensional disjunctive graph encoding model for the flexible job shop batch flow scheduling problem, linearly transforms it based on the idea of ​​topological sorting, and uses the floating time method to decode the scheduling scheme and identify the critical path. For the key nodes on the critical path, two neighborhood perturbation operations in the designed topological neighborhood structure are used to efficiently and stably output feasible neighborhood solutions to avoid the generation of illegal neighborhood solutions.

[0048] The present invention is further described in detail below with reference to specific embodiments.

[0049] See also Figure 2 , Figure 3 and Figure 4 In a precision-equipped processing workshop, there are 3 processing machines and 3 products to be processed. The number of processes for each product is 2, and the required quantity for each product is 10 pieces. The length of each coding layer in the three-layer coding is 2+2+2=6.

[0050] This embodiment includes the following steps:

[0051] S1: Population initialization, taking the flexible job shop batch flow scheduling solution to be optimized as the initial solution;

[0052] S2: Establish a three-dimensional disjunctive graph encoding model for the flexible job batch flow scheduling problem. The initial solution in S1 is expressed through a three-dimensional disjunctive graph, and the optimization goal is to minimize the maximum completion time.

[0053] See also Figure 2 , the three-dimensional disjunctive graph encoding model maps the product number, process number and sub-batch number corresponding to each sub-batch in the flexible job batch flow scheduling to the product axis, process axis and sub-batch axis respectively; each coordinate position in the three-dimensional disjunctive graph encoding model represents a sub-batch node, and the sub-batch nodes are connected by product arcs, sub-batch arcs and machine arcs. The product arc is the process sequence constraint arc between the previous and next processes, the sub-batch arc is the virtual arc between the sub-batch nodes of the same process, and the machine arc is the connection arc between the previous and next tasks on the same machine. Among them, J types of products need to be manufactured in a workshop containing M machines, and each product contains O j The process route of the product is known, and each process may be processed by one of multiple machines. The quantity of each product to be produced is D, and in each process, the same type of products can be divided into several sub-batches.

[0054] S3: Based on the three-dimensional disjunctive graph encoding model in S2, topological sorting decoding is performed to obtain a one-dimensional topological linked list;

[0055] The specific steps of topological sorting decoding are as follows: create an empty topological linked list, start from the starting node, calculate the in-degree of all nodes, put a node V among all nodes with in-degree 0 into the topological linked list, and reduce the in-degree of all adjacent nodes by 1, and repeat this cycle. As long as it is determined that there is a node with in-degree 0, it will be placed in the topological linked list until all nodes have been placed. Figure 2 The topological linked list in the lower part, the order in the linked list is the order of the nodes after topological sorting.

[0056] S4: Use the floating time method to identify the critical path. Based on the topological linked list in step S3, traverse each sub-batch node in the topological linked list in a linear order, insert the node with a floating time of 0 into the set to form the critical path;

[0057] The calculation process of floating time is:

[0058] According to the directional relationship between the connecting arcs of each node in the topological linked list, starting from the starting node, recursively calculate the earliest start time ES of each sub-batch node j,o,s,m After recursively reaching the termination node, reverse recursion is used to calculate the latest start time LS of each sub-batch node j,o,s,m , the calculation formulas for the earliest start time and the latest start time are as follows:

[0059]

[0060]

[0061] in, Represents the sub-batch node SL j,o,s,m The earliest start time of the preceding node, Represents the sub-batch node SL j,o,s,m The latest start time of the subsequent nodes, Represents the sub-batch node SL j,o,s,m The processing time of the preceding node, TC j,o,s,m Represents the sub-batch node SL j,o,s,m The processing time;

[0062] The earliest start time ES based on each sub-batch node j,o,s,m and the latest start time LS j,o,s,m , calculate the floating time TF j,o,s,m , the calculation formula is as follows:

[0063] TF j,o,s,m =LS j,o,s,m -ES j,o,s,m .

[0064] S5: For each key node on the critical path, a topological neighborhood structure is used to obtain a neighborhood solution; the topological neighborhood structure includes two neighborhood perturbation operations: the neighborhood perturbation operation TNS-1 is set to move the key nodes on the same machine, and the neighborhood perturbation operation TNS-2 is set to move the key nodes across machines;

[0065] S51: Selection of neighborhood perturbation operation: a randomly generated probability value P is used to determine which neighborhood perturbation operation is performed on the basis of the current solution to generate a new solution. If P>0.5, the neighborhood perturbation operation TNS-1 is selected, otherwise the neighborhood perturbation operation TNS-2 is selected.

[0066] S52: feasibility determination of the neighborhood disturbance operation, based on the neighborhood disturbance operation selected in S51, and according to the determination theorem, a feasibility determination is performed, wherein the determination theorem is set as follows:

[0067] Neighborhood perturbation operation TNS-1 corresponding to the judgment theorem 1: sub-batch S and For two nodes in the key block, only when When the constraint condition is After moving to node S, a loop-free feasible solution can be generated; where Index represents the index position of the node in the topological linked list, S JP and S JS They represent the previous node and the next node of node S in the process constraint, respectively. MP and S MS They represent the immediate preceding node and the immediate following node of node S in the machine task order constraint, respectively. and Respectively represent nodes The previous and next nodes on the process constraints, and Respectively represent nodes The immediate preceding node and the immediate succeeding node on the machine task order constraint;

[0068] Theorem 2 corresponding to the neighborhood perturbation operation TNS-2: If you want to move node S to machine M', you need to find the previous node S that is also on machine M'. M’P and the next node S M’S , and ensure that the position index in the topological linked list satisfies Index(S M ’P ) <Index(S),Index(S)<Index(S M’S ), then move node S to machine M' and insert it into node S M’P and S M’S There will be no infeasible solutions with cycles;

[0069] S53: Execution of neighborhood perturbation operation. When the determination theorem is not satisfied, the position of the key node is kept unchanged. When the determination theorem is satisfied, the neighborhood perturbation operation is executed, the position of the key node is exchanged, and a new neighborhood solution is generated.

[0070] Among them, the specific execution process of the neighborhood perturbation operation is:

[0071] Neighborhood Perturbation Operation TNS-1 See Figure 3 Its main function is to change the position of the node on the critical path within the block, perform an exchange operation with the first node or the last node of the block, and then generate a feasible neighborhood solution. Figure 3 As shown in (a) in the figure, if the sub-batch node SL 2,2,1 With SL 1,2,2 Exchange, because Index(SL 1,1,2 ) <Index(SL 2,2,1 ) <Index(SL 1,3,2 ), so exchanging the positions of two nodes will not produce an infeasible solution. Figure 3 As shown in (b) in the figure, if the sub-batch node SL 2,2,1 With SL 1,2,2 Exchange, because Index(SL 2,2,1 ) <Index(SL 1,1,2 ) <Index(SL 1,3,2 ), so after swapping the two points, (SL 1,1,2 →SL 1,2,2 →SL 1,1,2 ) cycle, resulting in an infeasible solution.

[0072] Neighborhood Perturbation Operation TNS-2 See Figure 4 Its main function is to change the processing machine of the node on the critical path. After determining the machine number to be inserted, it searches for the pre-order and post-order nodes of the machine on the topological linked list and performs the topological k-insertion operation. Figure 4 As shown in Figure 1, if we move the sub-batch node S from machine M2 to machine M1, we first need to find the immediate predecessor task S on the original machine M2. MP and the next task S MS , and the previous task S to be inserted into machine M1 M’P and subsequent task S M’S , and then perform an arc breaking and reconnecting operation to obtain a feasible neighborhood solution that meets the requirements.

[0073] S6: Calculate the maximum completion time, select the one with the smallest maximum completion time from the neighborhood solutions as the new optimal solution, and when the maximum completion time of the optimal solution is better than the initial solution, replace the initial solution with the optimal solution to update the population, and determine whether the termination condition is met. If so, output the optimal solution, and if not, go to step S1. The termination condition is that the number of iterations reaches a predetermined value.

[0074] Among them, the maximum completion time cmax The calculation formula is as follows:

[0075] c max =Max(c j,o,s,m ) o∈{1,2,...,O j}; s∈{1,2,...,N jo}; m∈{1,2,...,M}

[0076] In the formula, j is the subscript of the product, and its range is j = 1, 2, ..., J, J is the total number of products; o is the subscript of the process corresponding to product j, and its range is o = 1, 2, ..., O j , O j is the total number of processes for the product; s is the subscript of the subbatch, ranging from s = 0, 1, ..., sn j,o , where sn j,o Representative process O j,o The number of sub-batches divided; m is the subscript of the machine, ranging from m = 0, 1, ..., M, where M is the total number of machines; c j,o,s,m Representative process O j,o The corresponding s-th sub-batch SL j,o,s The completion time on machine m.

[0077] The present invention also provides a computer-readable storage medium, in which a computer program is stored. When the computer program is run on a computer, the computer is enabled to execute the above-mentioned flexible job shop batch flow scheduling method with a topological neighborhood structure.

[0078] The present invention also provides an electronic device, comprising a processor and a memory, wherein the memory stores a computer program, and the processor is used to execute the above-mentioned flexible job shop batch flow scheduling method with a topological neighborhood structure by calling the computer program stored in the memory.

[0079] It will be easily understood by those skilled in the art that the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A flexible job shop batch flow scheduling method with a topological neighborhood structure, characterized in that: The following steps are involved: S1: Population initialization, taking the flexible job shop batch flow scheduling solution to be optimized as the initial solution; S2: Establish a three-dimensional disjunctive graph encoding model for the flexible job shop batch flow scheduling problem. The initial solution in S1 is expressed through a three-dimensional disjunctive graph, and the optimization goal is to minimize the maximum completion time. S3: Based on the three-dimensional disjunctive graph encoding model in S2, topological sorting decoding is performed to obtain a one-dimensional topological linked list; S4: Use the floating time method to identify the critical path. Based on the topological linked list in step S3, traverse each sub-batch node in the linear topological linked list in a linear order, insert the node with a floating time of 0 into the set to form a critical path; S5: For each key node on the critical path, a topological neighborhood structure is used to obtain a neighborhood solution; the topological neighborhood structure includes two neighborhood perturbation operations: the neighborhood perturbation operation TNS-1 is set to move the key nodes on the same machine, and the neighborhood perturbation operation TNS-2 is set to move the key nodes across machines; S6: Calculate the maximum completion time, and select the one with the smallest maximum completion time from the neighborhood solutions as the new optimal solution. When the maximum completion time of the optimal solution is better than the initial solution, replace the initial solution with the optimal solution to update the population and determine whether the termination condition is met. If so, output the optimal solution. If not, go to step S1.

2. A flexible job shop batch flow scheduling method with a topological neighborhood structure as claimed in claim 1, characterized in that: In step S2, the three-dimensional disjunctive graph encoding model maps the product number, process number and sub-batch number corresponding to each sub-batch in the flexible job batch flow scheduling to the product axis, process axis and sub-batch axis respectively; each coordinate position in the three-dimensional disjunctive graph encoding model represents a sub-batch node, and the sub-batch nodes are connected by product arcs, sub-batch arcs and machine arcs. The product arc is the process sequence constraint arc between the previous and next processes, the sub-batch arc is the virtual arc between the sub-batch nodes of the same process, and the machine arc is the connection arc between the previous and next tasks on the same machine.

3. A flexible job shop batch flow scheduling method with a topological neighborhood structure as claimed in claim 1, characterized in that: In step S3, the specific steps of topological sorting decoding are: create a new empty topological linked list, starting from the starting node, calculate the in-degree of all nodes, put a node V among all nodes with in-degree 0 into the topological linked list, and reduce the in-degree of all adjacent nodes by 1, and repeat this cycle. As long as it is determined that there is a node with in-degree 0, it will be placed in the topological linked list until all nodes have been placed. At this time, the order of the topological linked list is the order of the nodes after topological sorting.

4. A flexible job shop batch flow scheduling method with a topological neighborhood structure as claimed in claim 1, characterized in that: The calculation process of the floating time in step S4 is: According to the directional relationship between the connecting arcs of each node in the topological linked list, starting from the starting node, recursively calculate the earliest start time ES of each sub-batch node j,o,s,m After recursively reaching the termination node, reverse recursion is used to calculate the latest start time LS of each sub-batch node j,o,s,m , the calculation formulas for the earliest start time and the latest start time are as follows: in, Represents the sub-batch node SL j,o,s,m The earliest start time of the predecessor node, Represents the sub-batch node SL j,o,s,m The latest start time of the subsequent nodes, Represents the sub-batch node SL j,o,s,m The processing time of the preceding node, TC j,o,s,m Represents the sub-batch node SL j,o,s,m The processing time; The earliest start time ES based on each sub-batch node j,o,s,m and the latest start time LS j,o,s,m , calculate the floating time TF j,o,s,m , the calculation formula is as follows: TF j,o,s,m =LS j,o,s,m -ES j,o,s,m 。 5. A flexible job shop batch flow scheduling method with a topological neighborhood structure as claimed in claim 1, characterized in that: Step S5 specifically includes the following steps: S51: Selection of neighborhood perturbation operation: a randomly generated probability value P is used to determine which neighborhood perturbation operation is performed on the basis of the current solution to generate a new solution. If P>0.5, the neighborhood perturbation operation TNS-1 is selected, otherwise the neighborhood perturbation operation TNS-2 is selected. S52: feasibility determination of the neighborhood disturbance operation, based on the neighborhood disturbance operation selected in S51, and according to the determination theorem, a feasibility determination is performed, wherein the determination theorem is set as follows: Neighborhood perturbation operation TNS-1 corresponding to the judgment theorem 1: sub-batch S and For two nodes in the key block, only when When the constraint condition is After moving to node S, a loop-free feasible solution can be generated; where Index represents the index position of the node in the topological linked list, S JP and S JS They represent the previous node and the next node of node S in the process constraint, respectively. MP and S MS They represent the immediate preceding node and the immediate following node of node S in the machine task order constraint, respectively. and Respectively represent nodes The previous and next nodes on the process constraints, and Respectively represent nodes The immediate preceding node and the immediate succeeding node on the machine task order constraint; Theorem 2 corresponding to the neighborhood perturbation operation TNS-2: If you want to move node S to machine M', you need to find the previous node S that is also on machine M'. M’P and the next node S M’S , and ensure that the position index in the topological linked list satisfies Index(S M’P ) <Index(S),Index(S)<Index(S M’S ), then move node S to machine M' and insert it into node S M’P and S M’S There will be no infeasible solutions with cycles; S53: Execution of neighborhood perturbation operation. When the determination theorem is not satisfied, the position of the key node is kept unchanged. When the determination theorem is satisfied, the neighborhood perturbation operation is executed, the position of the key node is exchanged, and a new neighborhood solution is generated.

6. A flexible job shop batch flow scheduling method with a topological neighborhood structure as claimed in claim 1, characterized in that: Maximum completion time c max The calculation formula is as follows: o∈{1,2,...,O j }; s∈{1,2,...,N jo }; m∈{1,2,...,M}, where j is the subscript of the product, and its range is j=1,2,…,J, and J is the total number of products; o is the subscript of the process corresponding to product j, and its range is o=1,2,…,O j , O j is the total number of processes for the product; s is the subscript of the subbatch, ranging from s = 0, 1, ..., sn j,o , where sn j,o Representative process O j,o The number of sub-batches divided; m is the subscript of the machine, ranging from m = 0, 1, ..., M, where M is the total number of machines; c j,o,s,m Representative process O j,o The corresponding s-th sub-batch SL j,o,s The completion time on machine m.

7. A flexible job shop batch flow scheduling method with a topological neighborhood structure as claimed in claim 1, characterized in that: In step S6, the termination condition is that the number of iterations reaches a predetermined value.

8. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed on a computer, the computer is enabled to execute the method according to any one of claims 1 to 7.

9. An electronic device, characterized in that: The electronic device comprises a processor and a memory, wherein a computer program is stored in the memory, and the processor is configured to execute the method according to any one of claims 1 to 7 by calling the computer program stored in the memory.

Citation Information

Patent Citations

  • Critical path-combined hybrid neighborhood search algorithm for job-shop scheduling

    CN106611377A

  • Flexible job shop scheduling method based on multistage neighborhood structure and hybrid genetic algorithm

    CN112580922A

  • Hybrid flow shop scheduling method and system based on neighborhood structure

    CN116449780A

  • Flexible job shop scheduling method and device based on sub-batch division

    CN116880410A

  • Method and device for scheduling job shop

    JP1996315028A