Scheduling method, device and equipment for workshop assembly production of customized production
Through hierarchical analysis method and non-dominant sorting genetic algorithm, the production scheduling of customized production workshops is solved, and the problem of difficulty in selecting large-scale cluster orders and resource equipment is improved, production efficiency and equipment utilization rate are achieved, and personalized orders are achieved quickly deliver.
Patent Information
- Application Number
- CN202411172112.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-26
- Publication Date
- 2024-11-29
AI Technical Summary
When custom-made production workshops handle large-scale cluster orders and multi-resource equipment series, it is difficult to schedule production and select resource equipment, resulting in low production efficiency and equipment utilization.
The hierarchical analysis method is used to determine the priority of order production, and the process scheduling is optimized through the non-dominant sorting genetic algorithm (NSGA-II) to ensure the reasonable allocation of processing time and equipment resources.
It realizes priority management of large-scale cluster orders and rapid production of personalized orders, ensuring timely and high-quality delivery of customized products.
Smart Images

Figure CN119047776A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of manufacturing technology, and in particular to a scheduling method, device and equipment for workshop assembly production of customized production. Background Art
[0002] Customized production workshops are a flexible production model in the modern manufacturing industry, designed to meet the personalized needs of customers and respond quickly to market changes. Unlike traditional large-scale standardized production, customized production workshops can achieve small-batch and multi-variety production according to customers' specific requirements and orders. As consumers' demand for product personalization and uniqueness increases, the market demand for customized products is growing. This has prompted manufacturing companies to shift from traditional large-scale production models to flexible customized production. The development of modern information technology, intelligent manufacturing and automation technology has provided technical support for customized production. The application of technologies such as digital design, 3D printing, computerized numerical control (CNC) machining and the Internet of Things has made customized production more feasible and efficient. The development of modern information technology, intelligent manufacturing and automation technology has provided technical support for customized production. The application of technologies such as digital design, 3D printing, CNC machining and the Internet of Things has made customized production more feasible and efficient.
[0003] The customized production workshop adopts a flexible manufacturing system (FMS), which can convert production tasks and processes in a short time to meet the production needs of multiple varieties and small batches. Through close interaction with customers, the customized production workshop can customize the specifications, functions and appearance of products according to the specific requirements and design participation of customers. Customer needs directly drive the production process. In addition, the customized production workshop widely uses digital design and manufacturing technologies, such as computer-aided design (CAD) and computer-aided manufacturing (CAM) systems, 3D printing, CNC machining centers, etc., to achieve seamless connection and efficient operation from design to production. Internet of Things technology is used to monitor and optimize the production process in real time. Through modular design and production, the customized production workshop can quickly combine and configure different product modules to achieve diversified product customization. At the same time, modular design helps to reduce production costs and improve production efficiency. The customized production workshop has high requirements for the flexibility and response speed of the supply chain. By optimizing supply chain management, the timely supply of raw materials and parts is ensured to meet the rapid production needs of personalized orders.
[0004] Scheduling a customized production workshop is a key activity for managing and optimizing production resources and tasks to ensure that customized products are delivered to customers on time and with high quality. It has the characteristics of high variability, small batch production, and customer orientation. Due to the characteristics and challenges of customized production, workshop scheduling has become particularly complex and important. In the scheduling problem of customized workshop assembly production, there are generally large-scale cluster orders and the use of multiple resources and equipment in series. At this time, the efficiency of the generated scheduling plan and equipment utilization should be considered. In summary, how to consider the production scheduling of large-scale orders and the selection of corresponding resources and equipment in the assembly production process of the customized workshop has become the primary issue in its scheduling process. Summary of the invention
[0005] The technical purpose to be achieved by the embodiments of the present application is to provide a scheduling method, device and equipment for customized production workshop assembly production, so as to solve the current difficulties in production scheduling of large-scale orders and the selection of corresponding resources and equipment.
[0006] In order to solve the above technical problems, the embodiment of the present application provides a scheduling method for workshop assembly production of customized production, including:
[0007] Determine the production priority of the order set corresponding to each client among the orders to be scheduled based on the hierarchical analysis method;
[0008] Sorting the production scheduling priorities of the multiple order sets from high to low to obtain a production scheduling sequence, and encoding the processes involved in the multiple order sets and the available equipment resources for executing the processes according to the production scheduling sequence;
[0009] The processing time and equipment resources for scheduling the process in each of the order sets are determined based on the production scheduling sequence, the set of available equipment resources for executing the process, and a preset algorithm.
[0010] Specifically, the scheduling method described above determines the scheduling priority of the order set corresponding to each client in the orders to be scheduled based on the hierarchical analysis method, including:
[0011] Configure the decision target in the target layer, the decision criteria in the criterion layer, and the decision scheme in the scheme layer, wherein the decision target in the target layer is used to represent the target to be achieved for production scheduling, the decision criteria in the criterion layer is used to represent the data required for reference in determining the production scheduling priority, and the decision scheme in the scheme layer is a plurality of order sets;
[0012] Respectively constructing a first judgment matrix of each of the decision criteria under the plurality of decision objectives and a second judgment matrix of each of the decision plans under each of the decision criteria, wherein the values in the first judgment matrix are the relative importance of one decision criterion relative to another decision criterion, and the values in the second judgment matrix are the relative importance of one decision plan relative to another decision plan;
[0013] Respectively obtaining a first eigenvector of each of the first judgment matrices and a second eigenvector of each of the second judgment matrices;
[0014] Normalizing each of the first eigenvectors to obtain a first weight matrix of each of the decision criteria under each of the decision objectives, and normalizing each of the second eigenvectors to obtain a second weight matrix of each of the decision schemes under the decision criteria;
[0015] Obtaining comprehensive weights corresponding to the decision objectives according to the first weight matrix and the second weight matrix;
[0016] According to each of the comprehensive weights and the input scoring matrix, the priority score corresponding to each of the decision schemes is obtained, and the values in the scoring matrix are the empirical scores of each of the decision criteria in the predetermined criterion layer;
[0017] The order sets are sorted according to the priority scores to determine the production scheduling priority of each order set.
[0018] Preferably, in the scheduling method as described above, after constructing the first judgment matrix and the second judgment matrix, the method further includes:
[0019] Obtaining the maximum eigenvalue corresponding to a target judgment matrix, where the target judgment matrix is any one of the first judgment matrix and the second judgment matrix;
[0020] According to the maximum characteristic root, performing consistency check on the target judgment matrix;
[0021] If the target judgment matrix passes the consistency check, the step of obtaining the corresponding weight matrix, the step of obtaining the maximum characteristic root corresponding to another target judgment matrix, or the step of obtaining the comprehensive weight corresponding to each decision target is performed;
[0022] If the target judgment matrix fails the consistency check, the target judgment matrix is adjusted and the step of obtaining the maximum eigenvalue corresponding to the target judgment matrix is re-executed.
[0023] Specifically, the scheduling method as described above determines the processing time and equipment resources for scheduling the process in each of the order sets according to the production scheduling sequence, the set of available equipment resources for executing the process, and a preset algorithm, including:
[0024] Initializing algorithm parameters of the preset algorithm, the algorithm parameters including an initialization population and a number of iterations, the individuals in the population being a scheduling scheme, including a combination of a process code corresponding to each process and a device resource code corresponding to an available device resource for executing the process;
[0025] Determine whether the current number of iterations reaches the preset number of iterations;
[0026] If the current number of iterations does not reach the preset number of iterations, the preset algorithm is executed to obtain an optimized solution set, and the number of iterations is increased by one, and then the process returns to execute the step of determining whether the current number of iterations reaches the preset number of iterations;
[0027] If the current number of iterations reaches the preset number of iterations, a fast non-dominated sorting and congestion degree calculation are performed on the optimization solution set, and an optimal solution is determined;
[0028] Decoding the optimal solution to obtain a target scheduling solution, wherein the target scheduling solution includes a processing sequence of each process and a target device resource corresponding to each process in the device resource set;
[0029] The processing time and the equipment resources are scheduled for the processes in each of the order sets according to the target scheduling plan.
[0030] Preferably, in the above scheduling method, when the preset algorithm is a preset non-dominated sorting genetic algorithm (NSGA II), executing the preset algorithm to obtain an optimized solution set includes:
[0031] Obtaining the decision target value of each individual in the population with respect to each of the decision targets; and calculating the crossover mutation probability of each of the individuals according to the decision target value;
[0032] Perform crossover mutation according to the crossover mutation probability to obtain a process solution set;
[0033] Performing fast non-dominated sorting on the process solution set to obtain the Pareto front solution set;
[0034] The optimization solution set is obtained by screening according to the decision target value corresponding to each individual in the Pareto front solution set.
[0035] Furthermore, the scheduling method described above, screening according to the decision target value corresponding to each individual in the Pareto front solution set to obtain the optimization solution set, includes:
[0036] According to the decision target value corresponding to each individual in the Pareto front solution set, the crowding distance of the Pareto front solution set is calculated to obtain the sparsity corresponding to each Pareto front solution;
[0037] According to a preset sparsity standard, the Pareto front solution set is screened to obtain the optimized solution set.
[0038] Furthermore, the scheduling method described above performs crossover mutation according to the crossover mutation probability to obtain a process solution set, including:
[0039] The process code in the target individual obtained by crossover mutation is checked for process correctness. If a process sequence error occurs in the target individual, the target individual is corrected based on the process sequence in the original individual before crossover mutation occurs.
[0040] Preferably, the scheduling method as described above, after obtaining the optimization solution set, further comprises:
[0041] Determining whether the number of solutions in the optimization solution set meets the population quantity requirement;
[0042] If the population size requirement is not met, individuals are selected from the Pareto front solution set and added to the optimized solution set during the next iteration.
[0043] Another embodiment of the present application further provides a control device for workshop assembly production scheduling of customized production, including:
[0044] The first processing module is used to determine the production scheduling priority of the order set corresponding to each client in the orders to be scheduled based on the hierarchical analysis method;
[0045] A second processing module is used to sort the production scheduling priorities of the multiple order sets from high to low to obtain a production scheduling sequence, and encode the processes involved in the multiple order sets and the available equipment resources for executing the processes according to the production scheduling sequence;
[0046] The third processing module is used to determine the processing time and equipment resources for scheduling the process in each of the order sets according to the production scheduling sequence, the set of available equipment resources for executing the process and a preset algorithm.
[0047] Another embodiment of the present application also provides an electronic device, including a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the computer program, when executed by the processor, implements the steps of the scheduling method for workshop assembly production of customized production as described above.
[0048] Another embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the scheduling method for workshop assembly production of customized production as described above are implemented.
[0049] Another embodiment of the present application further provides a computer program product, including computer instructions, which, when executed by a processor, implement the steps of the scheduling method for workshop assembly production of customized production as described above.
[0050] Compared with the prior art, the scheduling method, device and equipment for customized workshop assembly production provided in the embodiments of the present application have at least the following beneficial effects:
[0051] Based on the hierarchical analysis method, the production scheduling priority of each order set is determined and sorted, realizing the priority management and maintenance of large-scale cluster orders; at the same time, based on the preset algorithm, the processing time and equipment resources for the process scheduling in each order set are determined to meet the rapid production needs of personalized orders. BRIEF DESCRIPTION OF THE DRAWINGS
[0052] Figure 1 One of the flow charts of the scheduling method for workshop assembly production for customized production of this application;
[0053] Figure 2 The second flowchart of the scheduling method for workshop assembly production for customized production of this application;
[0054] Figure 3 The third flowchart of the scheduling method for workshop assembly production for customized production of this application;
[0055] Figure 4 The fourth flowchart of the scheduling method for workshop assembly production of customized production of this application;
[0056] Figure 5 The fifth flowchart of the scheduling method for workshop assembly production for customized production of this application;
[0057] Figure 6 Flow chart 6 of the scheduling method for workshop assembly production for customized production of this application;
[0058] Figure 7A schematic diagram of the structure of a control device for workshop assembly production scheduling for customized production of this application;
[0059] Figure 8 It is an implementation form of combining process coding and equipment resource coding in this application. DETAILED DESCRIPTION
[0060] In order to make the technical problems, technical solutions and advantages to be solved by the application clearer, the following will be described in detail in conjunction with the accompanying drawings and specific embodiments. In the following description, specific details such as specific configurations and components are provided only to help fully understand the embodiments of the application. Therefore, it should be clear to those skilled in the art that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the application. In addition, for clarity and brevity, the description of known functions and structures has been omitted.
[0061] It should be understood that the references to "one embodiment" or "an embodiment" throughout the specification mean that the specific features, structures, or characteristics associated with the embodiment are included in at least one embodiment of the present application. Therefore, the references to "in one embodiment" or "in an embodiment" appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
[0062] In the various embodiments of the present application, it should be understood that the size of the serial numbers of the following processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
[0063] It should be understood that the term "and / or" in this article is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.
[0064] In the embodiments provided in the present application, it should be understood that "B corresponding to A" means that B is associated with A, and B can be determined according to A. However, it should also be understood that determining B according to A does not mean determining B only according to A, and B can also be determined according to A and / or other information.
[0065] See also Figure 1 An embodiment of the present application provides a scheduling method for customized production workshop assembly production, including:
[0066] Step S101, determining the production priority of the order set corresponding to each client among the orders to be scheduled based on the hierarchical analysis method;
[0067] Step S102, sorting the production scheduling priorities of the multiple order sets from high to low to obtain a production scheduling sequence, and encoding the processes involved in the multiple order sets and the available equipment resources for executing the processes according to the production scheduling sequence; a preset number of scheduling schemes can be obtained through encoding, wherein, see Figure 8 , a specific implementation form of process coding and equipment resource coding is given, in which the position in the process code represents the execution order, the value at the position (in other embodiments, it can also be represented by an identifier or other form to avoid the problem that the value cannot fully reflect all order sets) represents a specific order set, and the number of times the value appears represents the sequence number of each process in the corresponding order set, for example Figure 8 The first "1" in the code represents the first process of the first order set, and the second "1" represents the second process of the first order set; the position in the equipment resource code represents the execution order, and the value at the position (in other embodiments, it can also be represented by an identifier or other forms to avoid the problem that the value cannot fully reflect all order sets) represents the equipment number of the specific equipment resource;
[0068] Step S103, determining the processing time and equipment resources for scheduling the process in each of the order sets according to the production scheduling sequence, the set of available equipment resources for executing the process, and a preset algorithm.
[0069] In this embodiment, for the production scheduling of large-scale cluster orders, when scheduling, the production scheduling priority of the order set corresponding to each client is first obtained based on the hierarchical analysis method. The production scheduling priority is used to indicate the importance of each client, and then multiple order sets are sorted from high to low according to the production scheduling priority to obtain the production scheduling order, and the processing time and equipment resources of the process are scheduled based on the production scheduling order and the preset algorithm, thereby realizing the priority management and maintenance of large-scale cluster orders; at the same time, the processing time and equipment resources of the process scheduling in each of the order sets are determined based on the preset algorithm (preferably the improved NSGA-II algorithm in this embodiment), thereby meeting the rapid production requirements of personalized orders. This is conducive to ensuring that customized products are delivered to the client on time and with high quality.
[0070] See also Figure 2 Specifically, the scheduling method described above determines the scheduling priority of the order set corresponding to each client in the orders to be scheduled based on the hierarchical analysis method, including:
[0071] Step S201, configure the decision target in the target layer, the decision criteria in the criterion layer, and the decision scheme in the scheme layer, wherein the decision target in the target layer is used to represent the target to be achieved for production scheduling, the decision criteria in the criterion layer is used to represent the data required for reference to determine the production scheduling priority, and the decision scheme in the scheme layer is a plurality of order sets; the decision targets in this application include but are not limited to the minimum completion time, maximum equipment utilization, and maximum profit of all orders, etc., which are beneficial to improving the scheduling efficiency and reasonably and tightly scheduling equipment resources while considering the efficiency of production scheduling and the load rate of equipment resources; the decision criteria include but are not limited to order size, material quantity, and delivery deadline, etc. It should also be noted that the specific limitations on decision targets and decision criteria in this embodiment are only examples given to facilitate the understanding of those skilled in the art. Based on actual conditions, other decision targets and decision criteria set by those skilled in the art should also fall within the scope of protection of this application.
[0072] Step S202, respectively construct a first judgment matrix of each decision criterion under a plurality of decision targets and a second judgment matrix of each decision solution under each decision criterion, wherein the values in the first judgment matrix are the relative importance of one decision criterion relative to another decision criterion, and the values in the second judgment matrix are the relative importance of one decision solution relative to another decision solution. In a specific embodiment, the first judgment matrix (also referred to as the target layer-criterion layer matrix) is formed as an n-order matrix, namely A=[a ij ], where n is the number of decision criteria, a ij Indicates the relative importance of decision criterion i relative to decision criterion j. For example, a 12 =2, then a 21 =0.5. Similarly, the second judgment matrix (also called the criterion layer-scheme layer matrix) is expressed in a similar form to the first judgment matrix, which will not be described in detail here.
[0073] Step S203, respectively obtaining the first eigenvectors of each of the first judgment matrices and the second eigenvectors of each of the second judgment matrices, specifically, first solving the eigenvalues corresponding to each of the judgment matrices, and then determining the eigenvectors corresponding to each of the judgment matrices based on the eigenvalues, and further, obtaining the first eigenvector by obtaining the mean value of each row of elements in the first judgment matrix, and obtaining the second eigenvector by obtaining the mean value of each row of elements in the second judgment matrix;
[0074] Step S204, normalizing each of the first eigenvectors to obtain a first weight matrix of each of the decision criteria under each of the decision objectives, and normalizing each of the second eigenvectors to obtain a second weight matrix of each of the decision schemes under the decision criteria;
[0075] Step S205, according to the first weight matrix and the second weight matrix, the comprehensive weight corresponding to each of the decision targets is obtained, and the calculation formula thereof can be expressed as: Where n is the number of decision criteria, W G1 is the comprehensive weight corresponding to the decision target G1, W Ci is the weight of decision criterion i under decision objective G1, is the weight of the plan under decision criterion i under decision goal G1;
[0076] Step S206, obtaining the priority scores corresponding to the decision schemes according to the comprehensive weights and the input scoring matrix, wherein the values in the scoring matrix are the empirical scores of the decision criteria in the predetermined criterion layer; wherein the priority scores are determined according to the product of the comprehensive weight matrix and the scoring matrix, and it should be noted that the scoring matrix is preferably obtained by outputting the decision criteria to relevant experts after determining the decision criteria, and according to the empirical scores given by the relevant experts received;
[0077] Step S207, sorting according to the priority scores to determine the production scheduling priority of each order set. Specifically, the higher the priority score, the higher the production scheduling priority.
[0078] See also Figure 3 Preferably, in the scheduling method as described above, after constructing the first judgment matrix and the second judgment matrix, the method further includes:
[0079] Step S301, obtaining the maximum eigenvalue corresponding to the target judgment matrix, wherein the target judgment matrix is any one of the first judgment matrix and the second judgment matrix;
[0080] Step S302: Perform a consistency check on the target judgment matrix according to the maximum characteristic root. When performing the consistency check, first perform a consistency check based on the maximum characteristic root λ max Calculate the consistency index Where n is the number of decision criteria or decision solutions, and then judge whether the consistency check value CR = CI / RI is less than the preset value. If it is less than the preset value, it means the test is passed, otherwise it means the test is not passed, where RI is the random consistency index;
[0081] Step S303, if the target judgment matrix passes the consistency check, then execute the step of obtaining the corresponding weight matrix, the step of obtaining the maximum characteristic root corresponding to another target judgment matrix, or the step of obtaining the comprehensive weight corresponding to each decision target. It should be noted that the consistency check step can be located before or after obtaining the weight matrix of the target judgment matrix. When the positions are different, the steps executed after the check is passed are also different;
[0082] Step S304, if the target judgment matrix fails to pass the consistency check, the target judgment matrix is adjusted, and the step of obtaining the maximum eigenvalue corresponding to the target judgment matrix is re-executed. It should be noted that, in a specific embodiment, the numerical value in the target judgment matrix is a combination of a value range and a recommended value. When calculating, it is preferably calculated according to the recommended value. When the consistency check fails, the recommended value is changed based on the value range to achieve adjustment and ensure the smooth progress of subsequent steps.
[0083] See also Figure 4 Specifically, the scheduling method as described above determines the processing time and equipment resources for scheduling the process in each of the order sets according to the production scheduling sequence, the set of available equipment resources for executing the process, and a preset algorithm, including:
[0084] Step S401, initializing the algorithm parameters of the preset algorithm, wherein the algorithm parameters include an initialization population and the number of iterations; wherein an individual in the population is a scheduling scheme, including a combination of a process code corresponding to each process and an equipment resource code of an available equipment resource for executing the process, that is, for the initialization population, an individual therein is a combination of multiple process codes and equipment resource codes arranged and combined in a production scheduling order, wherein the same process code can be combined with equipment resource codes corresponding to multiple available equipment resources to obtain multiple different individuals;
[0085] Step S402, determining whether the current number of iterations reaches a preset number of iterations;
[0086] Step S403, if the current number of iterations has not reached the preset number of iterations, execute the preset algorithm to obtain an optimization solution set, and then increase the number of iterations by one and return to execute the step of determining whether the current number of iterations has reached the preset number of iterations;
[0087] Step S404: if the current number of iterations reaches the preset number of iterations, the optimization solution set is subjected to fast non-dominated sorting and congestion calculation, and the optimal solution is determined. It should be noted that the optimal solution is the most sparsely populated optimization solution determined based on the congestion among the optimization solutions that satisfy the fast non-dominated sorting; that is, when the preset number of iterations is reached, it indicates that the iteration target has been completed. At this time, the final optimal solution required can be determined based on the optimization solution set in the last iteration. More specifically, in order to ensure the accuracy of the optimal solution obtained, the present application determines the optimal solution based on fast non-dominated sorting and congestion calculation. Since there will be explanations on fast non-dominated sorting and congestion calculation in the following, the specific steps of fast non-dominated sorting and congestion calculation will not be described in detail here.
[0088] Step S405, decoding the optimal solution to obtain a target scheduling solution, wherein the target scheduling solution includes the processing sequence of each process and the target equipment resources corresponding to the process in the equipment resource set, wherein data decoding is to parse the encoded process code and equipment resource code into a process number or name, and an equipment number or name, etc., which are well known to the workshop staff, so that the workshop staff can perform scheduling according to the decoded target scheduling solution. It should be noted that after obtaining the target scheduling solution, the value of at least one of the decision targets corresponding to the target scheduling solution will also be output;
[0089] Step S406, scheduling the processing time and the equipment resources for the processes in each of the order sets according to the target scheduling plan. It should be noted that the processing time can be determined based on the order of the processes on each equipment resource and the time required for the processes.
[0090] See also Figure 5 Preferably, in the above-mentioned scheduling method, when the preset algorithm is a preset non-dominated sorting genetic algorithm, executing the preset algorithm to obtain an optimized solution set includes:
[0091] Step S501, obtaining the decision target value of each individual in the population with respect to each decision target, that is, calculating the corresponding decision target value according to the scheduling scheme corresponding to each individual;
[0092] Step S502, calculating the crossover mutation probability of each individual according to the decision target value, wherein the closer the decision target value is to the decision target, the lower the corresponding crossover mutation probability is, and vice versa;
[0093] Step S503, performing crossover mutation according to the crossover mutation probability to obtain a process solution set, wherein the diversity of the population can also be improved by crossover. Specifically, the crossover operation is to map and cross the coding gene part within the specified crossover interval, and the mutation operation is to select two gene sites for two-point crossover mutation;
[0094] Step S504, performing fast non-dominated sorting on the process solution set to obtain a Pareto front solution set, wherein the fast non-dominated sorting means that there is no individual due to judging the dominance and non-domination relationship between each individual and other individuals (specifically, judging the priority between individuals), when there is no individual better than the current individual, it is determined to be a non-dominated individual, and the population is traversed until all non-dominated individuals are found, and all non-dominated individuals constitute a Pareto front solution set;
[0095] Step S505, screening is performed according to the decision target values corresponding to each individual in the Pareto front solution set to obtain the optimization solution set, including but not limited to determining that a decision target value corresponding to an individual satisfies a corresponding threshold value as an optimization solution and adding it to the optimization solution set.
[0096] See also Figure 6 Further, the scheduling method as described above is screened according to the decision target value corresponding to each individual in the Pareto front solution set to obtain the optimization solution set, including:
[0097] Step S601, calculating the crowding distance of the Pareto front solution set according to the decision target value corresponding to each individual in the Pareto front solution set, and obtaining the sparsity corresponding to each Pareto front solution;
[0098] Step S602, screening the Pareto front solution set according to a preset sparsity standard to obtain the optimized solution set, that is, preferentially retaining individuals located in sparse areas.
[0099] Furthermore, the scheduling method described above performs crossover mutation according to the crossover mutation probability to obtain a process solution set, including:
[0100] The process correctness detection is performed on the process code in the target individual obtained by crossover mutation. If a process sequence error occurs in the target individual, the target individual is corrected based on the process sequence in the original individual before crossover mutation occurs. In a specific embodiment, the correction means include but are not limited to directly modifying the process code in the target individual to the process code in the original individual.
[0101] Preferably, the scheduling method as described above, after obtaining the optimization solution set, further comprises:
[0102] Determine whether the number of solutions in the optimization solution set meets the population size requirement, where the population size requirement is the key to iteration. Only when iteration is performed under a certain population size can the final solution be guaranteed to be the optimal solution. ;
[0103] If the population size requirement is not met, individuals are selected from the Pareto front solution set to be added to the optimized solution set during the next iteration to ensure the normal progress of the next iteration.
[0104] See also Figure 7 Another embodiment of the present application further provides a control device for workshop assembly production scheduling of customized production, including:
[0105] The first processing module 701 is used to determine the production scheduling priority of the order set corresponding to each client in the order to be scheduled based on the hierarchical analysis method;
[0106] The second processing module 702 is used to sort the production scheduling priorities of the multiple order sets from high to low to obtain a production scheduling sequence, and encode the processes involved in the multiple order sets and the available equipment resources for executing the processes according to the production scheduling sequence;
[0107] The third processing module 703 is used to determine the processing time and equipment resources for scheduling the process in each of the order sets according to the production scheduling sequence, the set of available equipment resources for executing the process and a preset algorithm.
[0108] Specifically, the control device as described above, the first processing module includes:
[0109] The first sub-processing module is used to configure the decision target in the target layer, the decision criteria in the criterion layer, and the decision scheme in the scheme layer, wherein the decision target in the target layer is used to represent the target to be achieved for production scheduling, the decision criteria in the criterion layer is used to represent the data required for reference in determining the production scheduling priority, and the decision scheme in the scheme layer is a plurality of the order sets;
[0110] A second sub-processing module is used to construct a first judgment matrix of each of the decision criteria under the multiple decision objectives and a second judgment matrix of each of the decision plans under each of the decision criteria, wherein the values in the first judgment matrix are the relative importance of one decision criterion relative to another decision criterion, and the values in the second judgment matrix are the relative importance of one decision plan relative to another decision plan;
[0111] A third sub-processing module, used for respectively obtaining the first eigenvectors of each of the first judgment matrices and the second eigenvectors of each of the second judgment matrices;
[0112] a fourth sub-processing module, configured to perform normalization processing on each of the first eigenvectors to obtain a first weight matrix of each of the decision criteria under each of the decision objectives, and to perform normalization processing on each of the second eigenvectors to obtain a second weight matrix of each of the decision schemes under the decision criteria;
[0113] A fifth sub-processing module, configured to obtain a comprehensive weight corresponding to each of the decision objectives according to the first weight matrix and the second weight matrix;
[0114] A sixth sub-processing module, for obtaining a priority score corresponding to each of the decision schemes according to each of the comprehensive weights and an input scoring matrix, wherein the values in the scoring matrix are the empirical scores of each of the decision criteria in the predetermined criterion layer;
[0115] The seventh sub-processing module is used to sort according to the priority scores to determine the production scheduling priority of each order set.
[0116] Preferably, in the control device as described above, the first processing module further comprises:
[0117] An eighth sub-processing module, configured to obtain a maximum eigenvalue corresponding to a target judgment matrix, wherein the target judgment matrix is any one of the first judgment matrix and the second judgment matrix;
[0118] A ninth sub-processing module, configured to perform a consistency check on the target judgment matrix according to the maximum characteristic root;
[0119] A tenth sub-processing module, configured to execute the step of obtaining a corresponding weight matrix, the step of obtaining a maximum characteristic root corresponding to another target judgment matrix, or the step of obtaining a comprehensive weight corresponding to each decision target if the target judgment matrix passes the consistency check;
[0120] The eleventh sub-processing module is used to adjust the target judgment matrix and re-execute the step of obtaining the maximum eigenvalue corresponding to the target judgment matrix if the target judgment matrix fails the consistency check.
[0121] Specifically, in the scheduling method as described above, the third processing module includes:
[0122] A twelfth sub-processing module is used to initialize algorithm parameters of the preset algorithm, wherein the algorithm parameters include an initialization population and a number of iterations, wherein an individual in the population is a scheduling scheme, including a combination of a process code corresponding to each process and a device resource code of an available device resource for executing the process;
[0123] The thirteenth sub-processing module is used to determine whether the current number of iterations reaches a preset number of iterations;
[0124] A fourteenth sub-processing module is used for executing the preset algorithm to obtain an optimization solution set if the current number of iterations has not reached the preset number of iterations, and then increasing the number of iterations by one and returning to execute the step of determining whether the current number of iterations has reached the preset number of iterations;
[0125] A fifteenth sub-processing module is used for performing fast non-dominated sorting and congestion calculation on the optimization solution set and determining the optimal solution if the current number of iterations reaches the preset number of iterations;
[0126] A sixteenth sub-processing module is used to decode the optimal solution to obtain a target scheduling solution, wherein the target scheduling solution includes a processing sequence of each process and a target device resource corresponding to each process in the device resource set;
[0127] A seventeenth sub-processing module is used to schedule the processing time and the equipment resources for the processes in each of the order sets according to the target scheduling plan.
[0128] Preferably, in the scheduling method as described above, when the preset algorithm is a preset non-dominated sorting genetic algorithm, the fourteenth sub-processing module comprises:
[0129] The first processing unit is used to obtain the decision target value of each individual in the population with respect to each of the decision targets; and calculate the crossover mutation probability of each of the individuals according to the decision target value;
[0130] A second processing unit, configured to perform crossover mutation according to the crossover mutation probability to obtain a process solution set;
[0131] A third processing unit is used to perform fast non-dominated sorting on the process solution set to obtain a Pareto front solution set;
[0132] The fourth processing unit is used to screen according to the decision target value corresponding to each individual in the Pareto front solution set to obtain the optimization solution set.
[0133] Furthermore, the control device as described above, the fourth processing unit, includes:
[0134] A first sub-processing unit is configured to calculate the crowding distance of the Pareto front solution set according to the decision target value corresponding to each individual in the Pareto front solution set, so as to obtain the sparsity corresponding to each Pareto front solution;
[0135] The second sub-processing unit is used to screen the Pareto front solution set according to a preset sparsity standard to obtain the optimized solution set.
[0136] Furthermore, the control device as described above, the fourteenth sub-processing module, further includes:
[0137] The fifth processing unit is used to perform process correctness detection on the process code in the target individual obtained by crossover mutation. If a process sequence error occurs in the target individual, the target individual is corrected based on the process sequence in the original individual before crossover mutation occurs.
[0138] Preferably, the control device as described above, the fourteenth sub-processing module, further includes:
[0139] A sixth processing unit, configured to determine whether the number of solutions in the optimization solution set meets the population number requirement;
[0140] The seventh processing unit is used to select and supplement individuals from the Pareto front solution set to the optimized solution set during the next iteration if the population quantity requirement is not met.
[0141] The control device embodiment of the customized production workshop assembly production scheduling of the present application is a device corresponding to the embodiment of the scheduling method of the customized production workshop assembly production described above. All the implementation means in the above method embodiment are applicable to the embodiment of the device and can achieve the same technical effect. The above control device provided in the embodiment of the present application can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. The parts and beneficial effects that are the same as those in the method embodiment in this embodiment will not be described in detail here.
[0142] Another embodiment of the present application further provides an electronic device, including a processor, a memory, and a computer program stored in the memory and executable on the processor. When the computer program is executed by the processor, the steps of the scheduling method for workshop assembly production of customized production as described above are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be described here.
[0143] Another embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the scheduling method for workshop assembly production of customized production as described above are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.
[0144] Another embodiment of the present application further provides a computer program product, including computer instructions, which, when executed by a processor, implement the steps of the scheduling method for workshop assembly production of customized production as described above, and can achieve the same technical effect. To avoid repetition, they are not repeated here.
[0145] In addition, the present application may repeat reference numerals and / or letters in different examples. This repetition is for the purpose of simplicity and clarity, and does not in itself indicate the relationship between the various embodiments and / or settings discussed.
[0146] It should also be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusions.
[0147] The above is a preferred embodiment of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles described in the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.
Claims
1. A scheduling method for customized production workshop assembly production, characterized in that: include: Determine the production priority of the order set corresponding to each client among the orders to be scheduled based on the hierarchical analysis method; Sorting the production scheduling priorities of the multiple order sets from high to low to obtain a production scheduling sequence, and encoding the processes involved in the multiple order sets and the available equipment resources for executing the processes according to the production scheduling sequence; The processing time and equipment resources for scheduling the process in each of the order sets are determined based on the production scheduling sequence, the set of available equipment resources for executing the process, and a preset algorithm.
2. The scheduling method according to claim 1, characterized in that: Based on the hierarchical analysis method, the production priority of the order set corresponding to each client in the orders to be scheduled is determined, including: Configure the decision target in the target layer, the decision criteria in the criterion layer, and the decision scheme in the scheme layer, wherein the decision target in the target layer is used to represent the target to be achieved for production scheduling, the decision criteria in the criterion layer is used to represent the data required for reference in determining the production scheduling priority, and the decision scheme in the scheme layer is a plurality of order sets; Respectively constructing a first judgment matrix of each of the decision criteria under the plurality of decision objectives and a second judgment matrix of each of the decision plans under each of the decision criteria, wherein the values in the first judgment matrix are the relative importance of one decision criterion relative to another decision criterion, and the values in the second judgment matrix are the relative importance of one decision plan relative to another decision plan; Respectively obtaining a first eigenvector of each of the first judgment matrices and a second eigenvector of each of the second judgment matrices; Normalizing each of the first eigenvectors to obtain a first weight matrix of each of the decision criteria under each of the decision objectives, and normalizing each of the second eigenvectors to obtain a second weight matrix of each of the decision schemes under the decision criteria; Obtaining comprehensive weights corresponding to the decision objectives according to the first weight matrix and the second weight matrix; According to each of the comprehensive weights and the input scoring matrix, the priority score corresponding to each of the decision schemes is obtained, and the values in the scoring matrix are the empirical scores of each of the decision criteria in the predetermined criterion layer; The order sets are sorted according to the priority scores to determine the production scheduling priority of each order set.
3. The scheduling method according to claim 2, characterized in that: After constructing the first judgment matrix and the second judgment matrix, the method further includes: Obtaining the maximum eigenvalue corresponding to a target judgment matrix, where the target judgment matrix is any one of the first judgment matrix and the second judgment matrix; According to the maximum characteristic root, performing consistency check on the target judgment matrix; If the target judgment matrix passes the consistency check, the step of obtaining the corresponding weight matrix, the step of obtaining the maximum characteristic root corresponding to another target judgment matrix, or the step of obtaining the comprehensive weight corresponding to each decision target is performed; If the target judgment matrix fails the consistency check, the target judgment matrix is adjusted and the step of obtaining the maximum eigenvalue corresponding to the target judgment matrix is re-executed.
4. The scheduling method according to claim 2, characterized in that: Determine the processing time and equipment resources for scheduling the process in each order set according to the production scheduling sequence, the set of available equipment resources for executing the process, and a preset algorithm, including: Initializing algorithm parameters of the preset algorithm, the algorithm parameters including an initialization population and a number of iterations, the individuals in the population being a scheduling scheme, including a combination of a process code corresponding to each process and a device resource code of an available device resource for executing the process; Determine whether the current number of iterations reaches the preset number of iterations; If the current number of iterations does not reach the preset number of iterations, the preset algorithm is executed to obtain an optimized solution set, and the number of iterations is increased by one, and then the process returns to execute the step of determining whether the current number of iterations reaches the preset number of iterations; If the current number of iterations reaches the preset number of iterations, a fast non-dominated sorting and congestion degree calculation are performed on the optimization solution set, and an optimal solution is determined; Decoding the optimal solution to obtain a target scheduling solution, wherein the target scheduling solution includes a processing sequence of each process and a target device resource corresponding to each process in the device resource set; The processing time and the equipment resources are scheduled for the processes in each of the order sets according to the target scheduling plan.
5. The scheduling method according to claim 4, characterized in that: In the case where the preset algorithm is a preset non-dominated sorting genetic algorithm, executing the preset algorithm to obtain an optimization solution set includes: Obtaining the decision target value of each individual in the population with respect to each of the decision targets; Calculating the crossover mutation probability of each individual according to the decision target value; Perform crossover mutation according to the crossover mutation probability to obtain a process solution set; Performing fast non-dominated sorting on the process solution set to obtain the Pareto front solution set; The optimization solution set is obtained by screening according to the decision target value corresponding to each individual in the Pareto front solution set.
6. The scheduling method according to claim 5, characterized in that: The optimization solution set is obtained by screening the decision target values corresponding to each individual in the Pareto front solution set, including: According to the decision target value corresponding to each individual in the Pareto front solution set, the crowding distance of the Pareto front solution set is calculated to obtain the sparsity corresponding to each Pareto front solution; According to a preset sparsity standard, the Pareto front solution set is screened to obtain the optimized solution set.
7. The scheduling method according to claim 5, characterized in that: Perform crossover mutation according to the crossover mutation probability to obtain a process solution set, including: The process code in the target individual obtained by crossover mutation is checked for process correctness. If a process sequence error occurs in the target individual, the target individual is corrected based on the process sequence in the original individual before crossover mutation occurs.
8. The scheduling method according to claim 5 or 6, characterized in that: After obtaining the optimization solution set, the method further includes: Determining whether the number of solutions in the optimization solution set meets the population quantity requirement; If the population size requirement is not met, individuals are selected from the Pareto front solution set and added to the optimized solution set during the next iteration.
9. A control device for workshop assembly production scheduling for customized production, characterized in that: include: The first processing module is used to determine the production scheduling priority of the order set corresponding to each client in the orders to be scheduled based on the hierarchical analysis method; A second processing module is used to sort the production scheduling priorities of the multiple order sets from high to low to obtain a production scheduling sequence, and encode the processes involved in the multiple order sets and the available equipment resources for executing the processes according to the production scheduling sequence; The third processing module is used to determine the processing time and equipment resources for scheduling the process in each of the order sets according to the production scheduling sequence, the set of available equipment resources for executing the process and a preset algorithm.
10. An electronic device, characterized in that: It comprises a processor, a memory and a computer program stored in the memory and executable on the processor, wherein when the computer program is executed by the processor, the steps of the scheduling method for workshop assembly production of customized production as described in any one of claims 1 to 8 are implemented.
11. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the scheduling method for workshop assembly production of customized production according to any one of claims 1 to 8 are implemented.
12. A computer program product, characterized in that The method comprises computer instructions, which, when executed by a processor, implement the steps of the scheduling method for workshop assembly production of customized production as described in any one of claims 1 to 8.
Citation Information
Cited By
Optimized scheduling method based on automatic production scheduling of furniture production and manufacturing
CN121352384A
Semiconductor equipment packaging production line scheduling method, device and equipment
CN122155176A
