Adaptive performance test intelligent scheduling optimization method, equipment and medium

By conducting a detailed analysis of the test tasks and resources, and optimizing the scheduling plan by combining real-time and historical data, the efficiency and accuracy issues in performance testing were resolved, achieving efficient resource utilization and flexible scheduling.

CN118627703BActive Publication Date: 2024-11-05STATE GRID FUJIAN ELECTRIC POWER CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411118005.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-15
Publication Date
2024-11-05
Estimated Expiration
2044-08-15

AI Technical Summary

Technical Problem

Existing technologies have low efficiency and poor accuracy in intelligent scheduling of performance tests, and traditional methods are time-consuming, labor-intensive, and difficult to adapt to rapidly changing test requirements.

Method used

By analyzing the experimental tasks and resources, an initial scheduling plan is generated. Combining real-time monitoring data and historical data, the critical path method and resource balancing optimization algorithm are used. A historical dynamic fusion algorithm is introduced to integrate data and optimize scheduling, thereby optimizing resource allocation and task order.

Benefits of technology

It improved the utilization rate of experimental resources, reduced resource waste, ensured that high-priority tasks received sufficient resources, enhanced the accuracy and adaptability of scheduling plans, and reduced project delays and resource conflicts.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118627703B_ABST
    Figure CN118627703B_ABST
Patent Text Reader

Abstract

The present invention discloses an adaptive performance test intelligent scheduling optimization method, device and medium, wherein the method comprises the following steps: S1: analyzing the test tasks and test resources, determining the test sequence and constraint conditions, and generating an initial scheduling plan; S2: collecting the test status and test task information in real time as real-time monitoring data, integrating the real-time monitoring data and historical data, and using a matching algorithm to perform real-time analysis on the integrated data to find the best task and resource pairing, and adjusting the scheduling plan according to the best task and resource pairing to obtain the best performance test intelligent scheduling plan. The present invention solves the problem of low efficiency and poor accuracy of intelligent scheduling of performance tests in the prior art.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of intelligent scheduling, and in particular relates to an adaptive performance test intelligent scheduling optimization method, device and medium. Background Art

[0002] In today's industrial and scientific research fields, performance testing is a key link to ensure that product quality and performance meet standards. These tests usually include testing various performance parameters of the product to verify whether it meets the predetermined performance indicators. With the development of science and technology, the types and performance requirements of products are increasing, and traditional performance testing methods face challenges in terms of efficiency and accuracy. Traditional performance test scheduling usually relies on manual planning and fixed test processes. This method is not only time-consuming and labor-intensive, but also difficult to adapt to rapidly changing test needs. For example, when faced with a large number of diverse test tasks, manual scheduling often makes it difficult to optimize resource allocation, resulting in inefficient use of test equipment and personnel. In addition, fixed test processes often lack flexibility and cannot be dynamically adjusted according to actual test results, which may lead to inefficient testing or inaccurate test results in some cases.

[0003] The Chinese patent with publication number CN116880396A discloses a method for dynamic collaborative scheduling of smart factories, which includes the following steps: data collection and real-time monitoring, installing sensors and equipment to collect real-time data from all aspects of the factory; establishing a real-time monitoring system to collect, store and process the real-time data; task optimization and scheduling, defining the goal of task optimization; using a scheduling algorithm to optimize and allocate tasks based on the real-time data and the optimization goal; collaborative communication and collaboration, establishing an intelligent communication system; designing collaborative algorithms to formulate collaborative strategies; real-time monitoring and feedback control; data analysis and intelligent decision-making, analyzing and mining the collected data to extract valuable information and insights; based on the results of the data analysis, making intelligent decisions and predictions to optimize production plans and scheduling strategies. This invention uses a scheduling algorithm to optimize the allocation of tasks based on real-time data, without considering the impact of historical data, and there may be risks of omissions or deviations when making scheduling decisions.

[0004] The Chinese patent with publication number CN114240125A discloses an online, adaptive power dispatch optimization method for distributed energy storage power stations, and establishes a deep Q network (DQN) framework; under this framework, the optimal charge and discharge power of the energy storage system of the distributed energy storage power station can be calculated online based on the historical power consumption data of the smart microgrid, without overcharging and overdischarging, and without exceeding the rated operating conditions, and the energy storage system is used to cut the peak of the regional power grid to optimize the operation efficiency of the regional power grid. This invention has the technical problems of low efficiency and poor accuracy of intelligent dispatching for performance tests. Summary of the invention

[0005] The present invention provides an adaptive performance test intelligent scheduling optimization method, device and medium, aiming to solve the problems of low efficiency and poor accuracy of intelligent scheduling of performance tests in the prior art.

[0006] In order to solve the above technical problems, the present invention provides an adaptive performance test intelligent scheduling optimization method, comprising the following steps:

[0007] S1: Analyze the test tasks and test resources, determine the test sequence and constraints, and generate an initial scheduling plan.

[0008] S2: Collect test status and test task information in real time as real-time monitoring data, integrate real-time monitoring data and historical data, and use matching algorithms to perform real-time analysis on the integrated data to find the best task and resource pairing, and adjust the scheduling plan based on the best task and resource pairing to obtain the best performance test intelligent scheduling plan.

[0009] Preferably, step S1 specifically comprises:

[0010] Collect detailed information of all test tasks, use statistical analysis tools to identify and analyze the key factors of each task, and conduct a comprehensive evaluation and analysis of the available test resources to obtain the analysis results of the test tasks and test resources.

[0011] According to the analysis results of experimental tasks and experimental resources, the critical path method is used to analyze the dependencies and potential resource conflicts between tasks, and the timeline of each task is planned and adjusted to obtain the optimal execution sequence and necessary constraints of the experiment.

[0012] Based on the best execution sequence of the experiments and the necessary constraints, the optimization algorithm is used to deal with the resource allocation problem and generate a preliminary scheduling plan.

[0013] Preferably, when dealing with resource allocation problems, a resource balancing optimization algorithm is introduced, and the resource balancing optimization algorithm includes the following steps:

[0014] Based on the collected pilot task details, determine the total resource and time requirements.

[0015] The resource balance index of each task is calculated, and by comparing the resource balance index of different tasks with the set balance index threshold, the balance problem of resource allocation is identified and the resource allocation analysis result is obtained.

[0016] Based on the analysis results of the resource balance index, adjust the resource allocation between tasks.

[0017] Preferably, the calculation formula of the resource balance index is:

[0018]

[0019] In the formula, is the resource balance index, For the task The priority coefficient of For the task The scheduled time; is the total number of tasks; For the task The scheduled time; For the task About Resources Quantity of demand; For resources Total available quantity; For resources On Task Importance weight in The number of resource types.

[0020] Preferably, in the process of integrating the real-time monitoring data and the historical data, a historical dynamic fusion algorithm is introduced to integrate the data. The historical dynamic fusion algorithm is specifically:

[0021] Defining the historical data matrix ,in, Indicates The task is in The execution efficiency on the resource; Historical data of tasks By introducing variables Perform enhancement processing to obtain the enhanced historical data matrix , The elements are represented as:

[0022]

[0023] In the formula, It is the compatibility indicator between tasks and resources; .

[0024] Transform the elements in the enhanced historical data matrix to obtain the transformed historical data :

[0025]

[0026] In the formula, is the transformation coefficient; To adjust the parameters.

[0027] The real-time monitoring data is processed by standardized integration to obtain the real-time data after standardized integration. The calculation formula of standardized integration processing is as follows:

[0028]

[0029] In the formula, It is real-time data that has been standardized and integrated; For the Real-time data of each task; is the time factor; is the scaling factor; is the offset coefficient;

[0030] Real-time data processed by standardized integration Constructing a real-time data set after standardized integration and processing .

[0031] The historical data and real-time monitoring data are introduced into the fusion function for integration processing to obtain the integrated data. The calculation formula of the fusion function is specifically as follows:

[0032]

[0033] In the formula, is the fusion function; To adjust the parameters globally; is the historical data balance factor; is the real-time data balancing factor.

[0034] On the other hand, the present invention also provides an adaptive performance test intelligent scheduling optimization device, the device comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor implementing the following steps when executing the computer program:

[0035] S1: Analyze the test tasks and test resources, determine the test sequence and constraints, and generate an initial scheduling plan.

[0036] S2: Collect test status and test task information in real time as real-time monitoring data, integrate real-time monitoring data and historical data, and use matching algorithms to perform real-time analysis on the integrated data to find the best task and resource pairing, and adjust the scheduling plan based on the best task and resource pairing to obtain the best performance test intelligent scheduling plan.

[0037] Preferably, step S1 specifically comprises:

[0038] Collect detailed information of all test tasks, use statistical analysis tools to identify and analyze the key factors of each task, and conduct a comprehensive evaluation and analysis of the available test resources to obtain the analysis results of the test tasks and test resources.

[0039] According to the analysis results of experimental tasks and experimental resources, the critical path method is used to analyze the dependencies and potential resource conflicts between tasks, and the timeline of each task is planned and adjusted to obtain the optimal execution sequence and necessary constraints of the experiment.

[0040] Based on the best execution sequence of the experiments and the necessary constraints, the optimization algorithm is used to deal with the resource allocation problem and generate a preliminary scheduling plan.

[0041] Preferably, when dealing with resource allocation problems, a resource balancing optimization algorithm is introduced, and the resource balancing optimization algorithm includes the following steps:

[0042] Based on the collected pilot task details, determine the total resource and time requirements.

[0043] The resource balance index of each task is calculated, and by comparing the resource balance index of different tasks with the set balance index threshold, the balance problem of resource allocation is identified and the resource allocation analysis result is obtained.

[0044] Based on the analysis results of the resource balance index, adjust the resource allocation between tasks.

[0045] Preferably, in the process of integrating the real-time monitoring data and the historical data, a historical dynamic fusion algorithm is introduced to integrate the data. The historical dynamic fusion algorithm is specifically:

[0046] Defining the historical data matrix ,in, Indicates The task is in The execution efficiency on the resource; Historical data for tasks By introducing variables Perform enhancement processing to obtain the enhanced historical data matrix , The elements are represented as:

[0047]

[0048] In the formula, It is the compatibility indicator between tasks and resources; .

[0049] Transform the elements in the enhanced historical data matrix to obtain the transformed historical data :

[0050]

[0051] In the formula, is the transformation coefficient; To adjust the parameters.

[0052] The real-time monitoring data is processed by standardized integration to obtain the real-time data after standardized integration. The calculation formula of standardized integration processing is as follows:

[0053]

[0054] In the formula, It is real-time data that has been standardized and integrated; For the Real-time data of each task; is the time factor; is the scaling factor; is the offset coefficient;

[0055] Real-time data processed by standardized integration Constructing a real-time data set after standardized integration and processing .

[0056] The historical data and real-time monitoring data are introduced into the fusion function for integration processing to obtain the integrated data. The calculation formula of the fusion function is specifically as follows:

[0057]

[0058] In the formula, is the fusion function; To adjust the parameters globally; is the historical data balance factor; is the real-time data balancing factor.

[0059] On the other hand, the present invention further provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the method for intelligent scheduling optimization of an adaptive performance test as described in any embodiment of the present invention is implemented.

[0060] Compared with the prior art, the present invention has the following technical effects:

[0061] 1. The present invention can more effectively utilize test resources and avoid waste of resources by statistically analyzing the detailed information of test tasks and comprehensively evaluating test resources; use the critical path method and optimization algorithm to deal with resource allocation problems to ensure that test tasks are completed within the optimal time, thereby improving overall efficiency; analyze the dependencies and potential resource conflicts between tasks to help determine the optimal execution sequence and necessary constraints, and reduce project delays caused by resource conflicts; introduce a resource balance optimization algorithm to ensure that the distribution of resources and time between tasks is as balanced as possible by calculating the resource balance index of each task, thereby improving the completion quality of each task, and ensuring that high-priority tasks obtain sufficient resources while avoiding resource shortages for low-priority tasks.

[0062] 2. The present invention combines historical data and real-time monitoring data and introduces a historical dynamic fusion algorithm to provide a more comprehensive perspective for making scheduling decisions, improve the accuracy of scheduling plans, and enhance the adaptability to changing environments; through the integration of real-time monitoring data and historical data, the current status and past performance of resources can be accurately evaluated, which helps to optimize resource allocation, ensure that each task obtains the required resources, and improve the overall task execution efficiency. By introducing transformation coefficients and adjustment parameters, the historical dynamic fusion algorithm can take into account the uniqueness of different tasks and resource combinations, which helps to make more comprehensive scheduling decisions and reduce omissions or deviations. BRIEF DESCRIPTION OF THE DRAWINGS

[0063] Figure 1 It is an overall flow chart of the adaptive performance test intelligent scheduling optimization method described in the present invention. DETAILED DESCRIPTION

[0064] In order to make the objectives, technical solutions and advantages of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in combination with specific embodiments of the present application and with reference to the accompanying drawings.

[0065] Embodiment 1

[0066] This embodiment provides an adaptive performance test intelligent scheduling optimization method, see Figure 1 As shown, the following steps are included:

[0067] S1: Analyze the test tasks and test resources, determine the test sequence and constraints, and generate an initial scheduling plan.

[0068] As a preferred implementation of this embodiment, step S1 is specifically:

[0069] Collect detailed information of all test tasks, use statistical analysis tools to identify and analyze the key factors of each task, and conduct a comprehensive evaluation and analysis of the available test resources to obtain the analysis results of the test tasks and test resources. Specifically, first collect detailed information of all test tasks, which may include the purpose of the test, required test parameters, expected results, the type and quantity of resources required for each task (such as equipment, manpower), and the scheduled execution time. Use statistical analysis tools to identify and analyze the key factors of each task, such as the required time, required special equipment, and required personnel skills. At the same time, conduct a comprehensive evaluation and analysis of the available test resources, which include test equipment and personnel resources. The evaluation and analysis may include the function, status, and maintenance plan of the equipment. And determine the available personnel resources, including all personnel skills and available time.

[0070] Based on the analysis results of the test tasks and test resources, the critical path method is used to analyze the dependencies and potential resource conflicts between tasks, plan and adjust the timelines of each task, and identify key tasks that may cause project delays, so as to obtain the best execution sequence and necessary constraints for the tests; the dependencies include the result that some tasks need to complete other tasks first.

[0071] Furthermore, the critical path method comprises the following steps:

[0072] Define Tasks and Durations: List all tasks in the project, including the estimated duration of each task.

[0073] Identify dependencies between tasks: Determine the necessary order in which tasks must be completed. These dependencies are based on the specific needs of the project, such as the arrival of certain materials, the completion of the previous stage, etc.

[0074] Draw a project network diagram: Draw a project network diagram using nodes (representing tasks) and directed edges (representing dependencies) to visualize the dependencies between tasks and the overall flow of the project.

[0075] Calculate the Earliest Start Time and Latest Start Time: For each task in the network diagram, calculate the Earliest Start Time (EST) and the Latest Start Time (LST). EST is the earliest time the task can start without delaying the project. LST is the latest time the task must start to avoid delaying the project.

[0076] Determine the critical path: Calculate the longest path from start to finish in the project network diagram. The critical path determines the shortest completion time of the project. Any delay on the critical path will directly affect the overall completion time of the project.

[0077] Identify resource requirements and conflicts: For each task in the network diagram, identify the required resources (such as people, equipment, materials). Then analyze resource allocation and identify potential resource conflicts and bottlenecks.

[0078] Optimization and adjustment: According to the results of critical path and resource analysis, make task adjustments, including reallocating resources, using resource balancing techniques (such as resource smoothing or resource leveling) to resolve conflicts, or adjusting the schedule of non-critical tasks to improve overall efficiency.

[0079] Develop a plan and monitor progress: Develop a project execution plan based on the critical path method and continuously monitor the project progress during the project execution. Adjust the plan based on actual progress to cope with any unforeseen changes or delays.

[0080] Based on the best execution sequence of the experiments and the necessary constraints, the optimization algorithm is used to handle the resource allocation problem and generate a preliminary scheduling plan to ensure maximum resource utilization and time efficiency.

[0081] As a preferred implementation of this embodiment, when performing resource allocation, a resource balancing optimization algorithm is introduced to deal with the imbalance problem of resource allocation, ensuring that all test tasks are reasonably allocated resources and avoiding resource waste and excessive concentration. The resource balancing optimization algorithm includes the following steps:

[0082] Based on the collected experimental task details, evaluate the initial status of resource allocation, determine the total resource and time requirements, provide key baseline data for subsequent resource balance analysis, and understand the overall resource and time requirements.

[0083] The resource balance index of each task is calculated. As a preferred implementation of this embodiment, the calculation formula of the resource balance index is:

[0084]

[0085] In the formula, is the resource balance index, For the task The priority coefficient of For the task The scheduled time; is the total number of tasks; For the task The scheduled time; For the task About Resources Quantity of demand; For resources Total available quantity; For resources On Task Importance weight in is the number of resource types; For the task About Resources The proportion of the demand for the resource to the total amount of the resource; Indicate the importance of different resources in different tasks; Emphasized the impact of high-priority tasks on resource allocation; Representation Task The percentage of time spent on all tasks.

[0086] By calculating and comparing the resource balance index of different tasks, the resource allocation balance problem is identified and the resource allocation analysis results are obtained. The balance index threshold set based on experience For comparison, if , then too many resources are allocated to the task, resulting in insufficient resources for other tasks; if , tasks lack sufficient resources, while other tasks may have excess resources.

[0087] Based on the analysis results of the resource balance index, resource allocation is adjusted to optimize the balance of resource allocation between tasks, ensuring that each task is supported by appropriate resources while avoiding resource waste.

[0088] S2: Collect test status and test task information in real time as real-time monitoring data, integrate real-time monitoring data and historical data, and use matching algorithms to perform real-time analysis on the integrated data to find the best task and resource pairing, and adjust the scheduling plan based on the best task and resource pairing to obtain the best performance test intelligent scheduling plan.

[0089] Specifically, the real-time monitoring data may include the operating status of the test equipment, test equipment fault information, test environment information, resources required for the test task, the scheduled time required for the test task, and the test task priority.

[0090] As a preferred implementation of this embodiment, in the process of integrating real-time monitoring data and historical data, in order to accurately integrate historical data and real-time data to optimize scheduling decisions, a historical dynamic fusion algorithm is introduced. The historical dynamic fusion algorithm is specifically:

[0091] Defining the historical data matrix ,in, Indicates The task is in The execution efficiency on the resource; Historical data for tasks By introducing variables Perform enhancement processing to obtain the enhanced historical data matrix , where each element can be expressed as:

[0092]

[0093] In the formula, is the compatibility index between tasks and resources, obtained by empirical method; .

[0094] The elements in the enhanced historical data matrix are further transformed to obtain the transformed historical data :

[0095]

[0096] In the formula, The transformation factor is an adjustment factor for a specific task and resource combination, used to emphasize or reduce the impact of specific historical data; To adjust the parameters.

[0097] The real-time monitoring data is processed by standardized integration to obtain the real-time data after standardized integration. The specific calculation formula is:

[0098]

[0099] In the formula, It is real-time data that has been standardized and integrated; For the Real-time data of each task; is the time factor, which represents the timeliness of real-time monitoring data, that is, the latestness of the data; is the scaling factor; is the offset coefficient.

[0100] Real-time data processed by standardized integration Constructing a real-time data set after standardized integration and processing .

[0101] The historical data and real-time monitoring data are introduced into the fusion function for integration processing to obtain the integrated data. The calculation formula of the fusion function is specifically as follows:

[0102]

[0103] In the formula, is the fusion function; It is a global adjustment parameter used to adjust the sensitivity of the entire fusion function; is the historical data balance factor, It is a real-time data balancing factor, which is used to balance the importance of historical data and real-time monitoring data in the decision-making process.

[0104] Specifically, the matching algorithm may include the Hungarian algorithm, the KM algorithm, and the dynamic programming algorithm in practical applications.

[0105] The Hungarian algorithm is mainly used to solve the allocation problem, that is, how to optimally allocate a set of tasks to a set of resources so that the total cost is minimized or the total benefit is maximized. The algorithm constructs a weight matrix (each task corresponds to the cost or benefit of each resource), and then searches for the maximum match through a series of operations (such as reducing rows and columns, marking uncovered zero points, adjusting coverage lines, etc.) so that the total cost is minimized or the total benefit is maximized in resource matching.

[0106] The KM algorithm is an improved version of the Hungarian algorithm, which is mainly used to solve the maximum weight matching problem of weighted bipartite graphs. The algorithm continuously adjusts the vertex labels (a weight assigned to each vertex) to increase the total weight of the matching. The KM algorithm ensures that the maximum weight matching is found in polynomial time and is suitable for scenarios where the benefits between tasks and resources are not equivalent.

[0107] Dynamic programming algorithms solve complex problems by breaking them down into smaller sub-problems. They are suitable for scheduling tasks with dependencies. The algorithm can be used to optimize resource allocation, especially when there are sequential or other constraints between tasks.

[0108] This embodiment uses the Hungarian algorithm as an example to briefly explain the implementation of the algorithm. There are four test tasks to be processed (T1, T2, T3, T4) and four available test resources (R1, R2, R3, R4). Each task assigned to each resource has a corresponding cost, and the goal of resource allocation is to find an allocation method that minimizes the total cost. The resource cost table is shown in Table 1:

[0109] Table 1 Resource cost table

[0110]

[0111] Each number in the above table represents the cost of assigning the corresponding task to a resource. For example, the cost of assigning task T1 to resource R1 is 4, the cost of assigning task T1 to resource R2 is 2, and so on.

[0112] The implementation steps of the Hungarian algorithm are as follows:

[0113] A1: Subtract the minimum value of the row: This operation is performed on each row of the matrix, and the minimum value of the row is subtracted from each element.

[0114] A2: Subtract the minimum value of the column: This operation is performed on each column of the result matrix, and the minimum value of the column is subtracted from each element.

[0115] A3: Draw lines to cover all zero elements: Use the least number of lines to cover all zero elements in the matrix. If n lines can be used to cover (n is the order of the matrix), the optimal solution is found.

[0116] A4: Adjust the matrix: If you cannot cover all zeros with n lines, find the smallest element not covered by the lines, subtract the elements in all uncovered rows, and add to the elements in all covered columns. Return to step A3.

[0117] A5: Find the maximum match of zero elements: Find the maximum match of zero elements in the adjusted matrix, ensuring that each task and resource is selected only once.

[0118] Through the above steps, the following optimal matching results are obtained (with cost minimization as the goal): T1->R2, T2->R4, T3->R3, T4->R1. This allocation scheme ensures the minimum total cost.

[0119] Further, in order to verify the effectiveness and superiority of this embodiment, some application cases are provided below:

[0120] In the industrial field, performance experiment scheduling optimization methods are mainly used in manufacturing processes, product quality control and new product development testing. These experiments usually require highly precise equipment and professionally skilled personnel.

[0121] S1: Collect detailed information on test tasks: Detailed information on test tasks: including product durability testing, component performance testing, new material testing, etc. The detailed information may also include the parameters required for testing (such as temperature, pressure, force, etc.), and expected results (such as the specific value or range of performance indicators). Use statistical analysis tools to identify and analyze the key factors of each task for the detailed information: such as the time required (durability testing may require long-term continuous operation), the required special equipment (such as high-temperature test furnaces), and the required personnel skills (such as technicians with specific material science backgrounds). At the same time, conduct a comprehensive evaluation and analysis of the available test resources: comprehensively evaluate the functions, status, and maintenance plans of the test equipment; determine the available personnel resources, including their skills and available time.

[0122] Based on the analysis results of test tasks and test resources, the critical path method is used to analyze the dependencies between tasks and potential resource conflicts. For example, component performance testing must be carried out after new material testing because the latter provides the necessary data to plan and adjust the timelines of various tasks.

[0123] When performing resource allocation, the resource balancing optimization algorithm described in this embodiment is introduced to deal with the imbalance problem of resource allocation, ensuring that all test tasks receive reasonable resource allocation and avoiding resource waste and excessive concentration.

[0124] S2: Real-time monitoring data integration: Collect real-time monitoring data such as test equipment operating status, fault information, and environmental information, and integrate them with historical data.

[0125] The historical dynamic fusion algorithm combines historical data with real-time monitoring data to provide scheduling decision support. For example, if a device suddenly fails, the algorithm will adjust the scheduling plan in real time and prioritize other tasks to the normally operating devices.

[0126] The integrated data is analyzed in real time using the matching algorithm described in this embodiment to find the best task and resource pairing, and the scheduling plan is adjusted according to the best task and resource pairing to obtain the best performance test intelligent scheduling plan.

[0127] In the field of scientific research, performance experiment scheduling optimization methods are mainly used in laboratory management, scientific research projects and academic experiments. These experiments usually require multidisciplinary knowledge and complex experimental design. The following is a specific example:

[0128] S1: Collect detailed information on experimental tasks: including gene editing experiments, chemical reaction rate tests, physical property measurements, etc. The detailed information may also include experimental methods, required samples, and expected research results. Use statistical analysis tools to identify and analyze the key factors of each task: such as the time required (some chemical reactions require a specific time to reach equilibrium), the special equipment required (such as a high-precision mass spectrometer), and the required personnel skills (such as researchers with expertise in molecular biology). At the same time, conduct a comprehensive assessment and analysis of available experimental resources: including a comprehensive assessment of the function, status, and maintenance plan of laboratory equipment. Determine the available researcher resources, including their professional skills and available time.

[0129] Based on the analysis results of experimental tasks and experimental resources, the critical path method is used to analyze the dependencies between tasks and potential resource conflicts. For example, gene editing experiments must be carried out after obtaining specific cell lines, and the timelines of various tasks are planned and adjusted.

[0130] When performing resource allocation, the resource balancing optimization algorithm described in this embodiment is introduced to deal with the imbalance problem of resource allocation, ensuring that all test tasks receive reasonable resource allocation and avoiding resource waste and excessive concentration.

[0131] S2: Real-time monitoring data integration: Collect real-time monitoring data about the laboratory environment (such as temperature, humidity) and equipment operating status, and integrate them with historical data.

[0132] The historical dynamic fusion algorithm combines historical data with real-time monitoring data to provide scheduling decision support. For example, if the laboratory environment changes suddenly (such as temperature rise), it may affect the results of certain chemical experiments. The historical dynamic fusion algorithm can adjust the scheduling plan in real time to postpone or advance certain experimental tasks.

[0133] The integrated data is analyzed in real time using the matching algorithm described in this embodiment to find the best task and resource pairing, and the scheduling plan is adjusted according to the best task and resource pairing to obtain the best performance test intelligent scheduling plan.

[0134] The above applications demonstrate the application of performance experiment scheduling optimization methods in different fields. Through the collection and analysis of detailed information, optimal allocation of resources and tasks, as well as real-time data monitoring and dynamic scheduling adjustment, resource utilization and experimental efficiency can be effectively improved.

[0135] Embodiment 2

[0136] Accordingly, this embodiment provides an adaptive performance test intelligent scheduling optimization device, which includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, it implements the adaptive performance test intelligent scheduling optimization method as described in any embodiment of the present invention.

[0137] Embodiment 3

[0138] This embodiment provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the method for intelligent scheduling optimization of an adaptive performance test as described in any embodiment of the present invention is implemented.

[0139] In the embodiments of the present application, "at least one" refers to one or more, and "more than one" refers to two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent the existence of A alone, the existence of A and B at the same time, and the existence of B alone. Among them, A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following" and similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b and c can be represented by: a, b, c, a and b, a and c, b and c, or a and b and c, where a, b, c can be single or multiple.

[0140] Those of ordinary skill in the art will appreciate that the various units and algorithm steps described in the embodiments disclosed herein can be implemented in a combination of electronic hardware, computer software, and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0141] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0142] In several embodiments provided in the present application, if any function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory; hereinafter referred to as: ROM), random access memory (Random Access Memory; hereinafter referred to as: RAM), disk or optical disk, and other media that can store program codes.

[0143] The above descriptions are merely embodiments of the present invention and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. An adaptive performance test intelligent scheduling optimization method, characterized in that: The following steps are involved: S1: Analyze the test tasks and test resources, determine the test sequence and constraints, and generate an initial scheduling plan; S2: Collect test status and test task information in real time as real-time monitoring data, integrate real-time monitoring data and historical data, and use matching algorithms to perform real-time analysis on the integrated data to find the best task and resource pairing, and adjust the scheduling plan based on the best task and resource pairing to obtain the best performance test intelligent scheduling plan; Step S1 specifically includes: collecting detailed information of all test tasks, using statistical analysis tools to identify and analyze key factors of each task, and conducting a comprehensive evaluation and analysis of available test resources to obtain analysis results of test tasks and test resources; According to the analysis results of test tasks and test resources, the critical path method is used to analyze the dependencies and potential resource conflicts between tasks, and the timeline of each task is planned and adjusted to obtain the best execution sequence and necessary constraints of the test; Based on the best execution sequence of the experiment and the necessary constraints, the optimization algorithm is used to deal with the resource allocation problem and generate a preliminary scheduling plan; Step S2: In the process of integrating the real-time monitoring data and the historical data, a historical dynamic fusion algorithm is introduced to integrate the data. The historical dynamic fusion algorithm is specifically: Defining the historical data matrix ,in, Indicates The task is in The execution efficiency on the resource; Historical data of tasks By introducing variables Perform enhancement processing to obtain the enhanced historical data matrix , The elements are represented as: In the formula, It is the compatibility indicator between tasks and resources; ; Transform the elements in the enhanced historical data matrix to obtain the transformed historical data : In the formula, is the transformation coefficient; To adjust the parameters; The real-time monitoring data is processed by standardized integration to obtain the real-time data after standardized integration. The calculation formula of standardized integration processing is as follows: In the formula, It is real-time data that has been standardized and integrated; For the Real-time data of each task; is the time factor; is the scaling factor; is the offset coefficient; Real-time data processed by standardized integration Constructing a real-time data set after standardized integration and processing ; The historical data and real-time monitoring data are introduced into the fusion function for integration processing to obtain the integrated data. The calculation formula of the fusion function is specifically as follows: In the formula, is the fusion function; To adjust the parameters globally; is the historical data balance factor; is the real-time data balancing factor.

2. The adaptive performance test intelligent scheduling optimization method according to claim 1 is characterized in that: When dealing with resource allocation problems, a resource balancing optimization algorithm is introduced, which includes the following steps: Determine the total resource and time requirements based on the collected test task details; Calculate the resource balance index of each task, and identify the balance problem of resource allocation by comparing the resource balance index of different tasks with the set balance index threshold, and obtain the resource allocation analysis result; Based on the analysis results of the resource balance index, adjust the resource allocation between tasks.

3. The adaptive performance test intelligent scheduling optimization method according to claim 2 is characterized in that: The calculation formula of the resource balance index is: In the formula, is the resource balance index, For the task The priority coefficient of For the task The scheduled time; is the total number of tasks; For the task The scheduled time; For the task About Resources Quantity of demand; For resources Total available quantity; For resources On Task Importance weight in The number of resource types.

4. Adaptive performance test intelligent scheduling optimization equipment, the equipment comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the following steps when executing the computer program: S1: Analyze the test tasks and test resources, determine the test sequence and constraints, and generate an initial scheduling plan; S2: Collect test status and test task information in real time as real-time monitoring data, integrate real-time monitoring data and historical data, and use matching algorithms to perform real-time analysis on the integrated data to find the best task and resource pairing, and adjust the scheduling plan based on the best task and resource pairing to obtain the best performance test intelligent scheduling plan; Step S1 specifically includes: collecting detailed information of all test tasks, using statistical analysis tools to identify and analyze key factors of each task, and conducting a comprehensive evaluation and analysis of available test resources to obtain analysis results of test tasks and test resources; According to the analysis results of test tasks and test resources, the critical path method is used to analyze the dependencies and potential resource conflicts between tasks, and the timeline of each task is planned and adjusted to obtain the best execution sequence and necessary constraints of the test; Based on the best execution sequence of the experiment and the necessary constraints, the optimization algorithm is used to deal with the resource allocation problem and generate a preliminary scheduling plan; Step S2: In the process of integrating the real-time monitoring data and the historical data, a historical dynamic fusion algorithm is introduced to integrate the data. The historical dynamic fusion algorithm is specifically: Defining the historical data matrix ,in, Indicates The task is in The execution efficiency on the resource; Historical data of tasks By introducing variables Perform enhancement processing to obtain the enhanced historical data matrix , The elements are represented as: In the formula, It is the compatibility indicator between tasks and resources; ; Transform the elements in the enhanced historical data matrix to obtain the transformed historical data : In the formula, is the transformation coefficient; To adjust the parameters; The real-time monitoring data is processed by standardized integration to obtain the real-time data after standardized integration. The calculation formula of standardized integration processing is as follows: In the formula, It is real-time data that has been standardized and integrated; For the Real-time data of each task; is the time factor; is the scaling factor; is the offset coefficient; Real-time data processed by standardized integration Constructing a real-time data set after standardized integration and processing ; The historical data and real-time monitoring data are introduced into the fusion function for integration processing to obtain the integrated data. The calculation formula of the fusion function is specifically as follows: In the formula, is the fusion function; To adjust the parameters globally; is the historical data balance factor; is the real-time data balancing factor.

5. The adaptive performance test intelligent scheduling optimization device according to claim 4 is characterized in that: When dealing with resource allocation problems, a resource balancing optimization algorithm is introduced, which includes the following steps: Determine the total resource and time requirements based on the collected test task details; Calculate the resource balance index of each task, and identify the balance problem of resource allocation by comparing the resource balance index of different tasks with the set balance index threshold, and obtain the resource allocation analysis result; Based on the analysis results of the resource balance index, adjust the resource allocation between tasks.

6. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the adaptive performance test intelligent scheduling optimization method according to any one of claims 1 to 3 is implemented.