A method for generating emergency repair plan for combat injuries based on emergency repair resource constraints

Abstract

The present invention discloses a method for generating a battle damage repair plan based on repair resource restrictions, which relates to the field of aircraft repair technology and includes the following steps: determining a basic repair list, searching for a schedulable job set in a to-be-scheduled job set according to a repair process tree; obtaining alternative scheduling plans based on the schedulable job set, which at least include a least-conflict priority scheduling plan, a critical path priority scheduling plan, a longest job priority scheduling plan, and a personnel idle priority scheduling plan; based on the above-mentioned alternative scheduling plans, according to the shortest time and most priority strategy, selecting an alternative scheduling plan that occupies the least time resources, and outputting the corresponding final repair list and final repair resources. The present invention considers whether the scheduling of various operations will cause conflicts. If conflicts occur, the operations should be rescheduled and arranged to generate repair scheduling plans with different focuses that meet resource reserves.

Description

Technical Field

[0001] The invention belongs to the technical field of aircraft maintenance, and in particular relates to a method for generating a battle damage repair plan based on repair resource limitations. Background Art

[0002] Through the repair of the damaged aircraft by the repair personnel, the repaired damaged aircraft can continue to participate in the combat, which can not only make up for the aircraft losses in the combat, but also supplement the combat effectiveness of the air force. However, the repair of damaged aircraft is time-sensitive and the task is heavy. If the repair task of the aircraft is to be completed efficiently, the demand for repair of damaged aircraft must be reasonably allocated.

[0003] In traditional solutions, the repair list is generally determined based on experience, or a mathematical model is established to predict the repair demand for combat-damaged aircraft through the model. Repair resources rely on the repair list and different scheduling schemes. Under different scheduling schemes, the repair resources required for the repair list are also different. However, repair resources are not only based on the repair list, but also on different scheduling schemes. Under different scheduling schemes, the repair resources required for the repair list are also different. For example, if the operations in the repair list that require the same type of repair resources are scheduled to operate at the same time, then the repair resources of this type must meet the simultaneous operation of the two, and if the scheduling arranges the two to operate at different times, then the repair resources of this type only need to be the most in demand of the two. Completing the repair task of combat damage requires a certain amount of resource consumption, but the total amount of available resources for repair is limited and cannot fully meet the repair task requirements. The resource demand conflict between repair tasks is bound to exist objectively.

[0004] A Chinese patent with application number 201910745852.6 discloses a method for evaluating the maintainability of military aircraft, including the following steps: statistically analyzing the fault information of equipment or complete machines; analyzing and calculating the associated faults based on the mean repair time model to evaluate the maintainability of the equipment or complete machine; constructing a mean repair time model to convert the traditional mean maintenance time model into an evaluation of the maintainability of the aircraft during the flight test; tracing the maintainability of the system or structure to which the equipment or complete machine belongs through the maintainability of the equipment or complete machine; the invention solves the problem that the traditional mean maintenance time model cannot be applied to the maintainability evaluation of the aircraft during the flight test, and effectively evaluates the maintainability of the aircraft during the flight test through the converted model, ensures the accuracy of the maintainability evaluation by determining the associated faults and effective maintenance time, and achieves the beneficial effect of faster and more efficient maintainability evaluation.

[0005] The Chinese patent application number CN201710653511.7 discloses a method for quickly assessing the combat damage level of combat aircraft, including first clarifying the damaged parts and their damage categories, determining the damage level of each damaged part, and then, for the repairable damaged parts, determining their impact on aircraft safety and mission through FMEA analysis to obtain the severity coefficient; at the same time, determining the repair time to obtain the repair time coefficient; and determining whether there are any usage restrictions after the repair to obtain the usage restriction coefficient; finally, calculating the damage level based on the above three coefficients, and determining the maintenance order based on the damage level. The combat damage level assessment method of this invention conducts qualitative and quantitative analysis on the three aspects of repair time, damage level and whether there are any usage restrictions under the conditions of existing maintenance and support resources. The results are reliable and can quickly determine the emergency repair plan.

[0006] Although the above maintenance assessment method takes into account the available resources for emergency repairs, it is still necessary to consider a variety of different performance indicators for emergency repair scheduling based on the emergency repair list and the supporting emergency repair resources under the constraints of the two. Therefore, when generating the scheduling plan, it is necessary to consider whether the scheduling of various operations will cause conflicts. If conflicts occur, the operations should be rescheduled to generate emergency repair scheduling plans with different focuses and that meet resource reserves. Summary of the invention

[0007] In order to solve the above problems, the present invention provides a method for generating a battle damage repair plan based on repair resource limitations.

[0008] The technical solution adopted by the present invention is:

[0009] The present invention provides a method for generating a battle injury repair plan based on repair resource limitation, comprising the following steps:

[0010] Step 1: Determine the basic emergency repair list and construct a set of pending operations, which includes several pending operations. Obtain the preceding operation, following operation, operation time and maintenance area corresponding to each pending operation.

[0011] Based on the combat damage situation, the actual maintenance area is divided, the actual maintenance area set is constructed, and the available operation start time of the actual maintenance area is obtained;

[0012] Step 2: According to the emergency repair process tree, find the schedulable operation set in the set of operations to be scheduled;

[0013] Step 3: Based on the schedulable job set, an alternative scheduling scheme is obtained, which includes at least a scheduling scheme with least conflict priority, a scheduling scheme with critical path priority, a scheduling scheme with longest job priority, and a scheduling scheme with personnel idleness priority;

[0014] Step 4: Based on the above alternative scheduling schemes, according to the shortest time and highest priority strategy, select the alternative scheduling scheme that occupies the least time resources, and output the corresponding final emergency repair list and final emergency repair resources.

[0015] Preferably, the method for obtaining the least conflicting priority scheduling scheme is:

[0016] S1.1 Select the job with the least conflict in the schedulable job set and schedule it first;

[0017] S1.2 Calculate the estimated start time of the priority scheduling operation with the least conflict based on the available start time of the maintenance area corresponding to the priority scheduling operation with the least conflict and the start time of the immediately preceding operation of the priority scheduling operation with the least conflict;

[0018] S1.3 Find the maintenance work that conflicts with the priority scheduling work with the least conflict under the estimated start time, update the estimated start time to the earliest non-conflicting time, and determine it as the actual start time of the priority scheduling work with the least conflict;

[0019] S1.4 calculates the actual completion time of the priority scheduling operation with the least conflicts, and updates the start time of the maintenance area corresponding to the priority scheduling operation with the least conflicts;

[0020] S1.5 delete the least conflicting priority scheduling job from the set of schedulable jobs;

[0021] S1.6 Repeat steps S1.1-S1.5 until the set of schedulable jobs becomes an empty set;

[0022] S1.7 obtains the actual start time and actual completion time of each schedulable job, and outputs the priority scheduling plan with the least conflicts.

[0023] Preferably, the screening conditions for scheduling jobs with the least conflicts first are:

[0024] Compare the operation time of the jobs in the schedulable job set, and select the schedulable job with the shortest operation time as the job with the least conflict and priority;

[0025] If there are multiple schedulable jobs with the shortest operation time, they will be used as the jobs with the least conflict and priority to be scheduled. The completion paths of all the jobs with the least conflict and priority to be scheduled are obtained, and the job with the longest completion path and the least conflict and priority to be scheduled is selected as the job with the least conflict and priority to be scheduled.

[0026] Preferably, the method for obtaining the critical path priority scheduling solution is:

[0027] S2.1 Calculate the critical path set in the basic repair list;

[0028] S2.2 based on the critical path set and the schedulable job set, select the critical path priority scheduling jobs;

[0029] S2.3 Calculate the estimated start time of the critical path priority scheduling operation based on the start time of the maintenance area corresponding to the critical path priority scheduling operation and the start time of the immediate predecessor operation of the critical path priority scheduling operation;

[0030] S2.4 Find the maintenance work that conflicts with the critical path priority scheduling work under the estimated start time, update the estimated start time to the earliest time that does not conflict, and determine it as the actual start time of the critical path priority scheduling work;

[0031] S2.5 calculates the actual completion time of the critical path priority scheduling operation and updates the maintenance area start time corresponding to the critical path priority scheduling operation;

[0032] S2.6 delete the critical path priority scheduling job from the schedulable job set;

[0033] S2.7 Repeat steps S2.1-S2.6 until the set of schedulable jobs becomes an empty set;

[0034] S2.8 obtains the actual start time and actual completion time of each schedulable task, and outputs the critical path priority scheduling plan.

[0035] Preferably, the method for calculating the critical path set is:

[0036] Get the earliest start time, latest completion time and latest start time of all jobs to be scheduled;

[0037] Calculate the time difference of all jobs to be scheduled based on the earliest start time and the latest start time, and build a total time difference set of jobs;

[0038] Selecting the to-be-scheduled jobs with a time difference of 0 from the total time difference set of jobs, and defining them as key nodes;

[0039] Obtain all the preceding tasks of the critical node and generate a critical path forest;

[0040] Based on the critical path forest, all critical paths are obtained through the depth-first search algorithm to construct the critical path set.

[0041] Preferably, the method for obtaining the critical path priority scheduling job is:

[0042] If the critical path set contains only one critical path, the starting job of the critical path will be used as the critical path priority scheduling job;

[0043] If the critical path set contains only N critical paths, the starting jobs and their operation times of all critical paths are obtained, and the starting job with the largest operation time is used as the priority scheduling job of the critical path.

[0044] Preferably, the method of the longest job first scheduling scheme is:

[0045] S3.1 Select the longest job from the schedulable job set and schedule it first;

[0046] S3.2 Calculate the estimated start time of the longest operation priority scheduling operation based on the available start time of the maintenance area corresponding to the longest operation priority scheduling operation and the start time of the immediately preceding operation of the longest operation priority scheduling operation;

[0047] S3.3 Find the maintenance work that conflicts with the longest operation priority scheduling work under the estimated start time, update the estimated start time to the earliest non-conflicting time, and determine it as the actual start time of the longest operation priority scheduling work;

[0048] S3.4 calculates the actual completion time of the longest operation priority scheduling operation, and updates the maintenance area start time corresponding to the longest operation priority scheduling operation;

[0049] S3.5 The longest job is preferentially scheduled and deleted from the set of schedulable jobs;

[0050] S3.6 Repeat steps S3.1-S3.5 until the set of schedulable jobs becomes an empty set;

[0051] S3.7 obtains the actual start time and actual completion time of each schedulable job, and outputs the longest job priority scheduling plan.

[0052] Preferably, if there are conflicting tasks, the completion times of the conflicting tasks are arranged from small to large, and the earliest start time that satisfies the personnel resources is found and used as the actual start time.

[0053] Preferably, the method of the personnel idle priority scheduling scheme is:

[0054] S4.1 Obtain the working status, required maintenance operations and completion time of each actual maintenance area, obtain personnel resource data, and select the operations with personnel idleness and priority scheduling in the schedulable operation set;

[0055] S4.2 Calculate the actual start time and actual completion time of the personnel idle priority scheduling operation;

[0056] S4.3 delete the idle priority scheduling task of the personnel from the set of schedulable tasks;

[0057] In S4.4, the personnel resources required for the personnel idle priority scheduling operation are deleted and the remaining personnel resources are updated;

[0058] S4.5 repeat steps S4.1-S4.4 until the set of schedulable jobs becomes an empty set;

[0059] S4.6 Update system time, release personnel resources required for completed maintenance work to update remaining personnel resources;

[0060] S4.7 Repeat steps S4.1-S4.6 until the set of jobs to be scheduled becomes an empty set;

[0061] S4.8 obtains the actual start time and actual completion time of each schedulable job, and outputs a personnel idle priority scheduling plan.

[0062] Preferably, the screening method for personnel idle priority scheduling operations is:

[0063] Based on the working status and required maintenance jobs of each actual maintenance area, the actual maintenance area with working status 0 is screened and all jobs in it are obtained, which are defined as the idle job set. Based on the personnel resources, all idle jobs that meet the personnel resource requirements are screened from the idle job set and recorded as personnel idle alternative priority scheduling jobs.

[0064] Calculate the completion path of all idle alternative priority scheduling jobs, the range of which is from the idle alternative priority scheduling job to the final job without a subsequent job; the idle alternative priority scheduling job corresponding to the longest completion path is the idle priority scheduling job.

[0065] Compared with the prior art, the present invention has the following beneficial effects:

[0066] The present invention provides a method for generating a battle damage repair plan based on repair resource constraints. Under the existing resource constraints, the repair scheduling of all maintenance operations in the repair list is completed according to multiple performance indicators. Under the repair list and existing resource constraints, multiple repair scheduling plans are generated based on four aspects: least conflict priority, critical path priority, longest operation priority, and personnel idle priority, thereby forming multiple complete, executable, and efficient repair plans for decision makers to choose from. Finally, a plan is recommended to the decision maker through the shortest time and highest priority strategy, and a battle damage repair plan with the shortest overall aircraft battle damage repair time is recommended. Considering multiple performance indicators, multiple reasonable repair scheduling plans that meet the constraints of the aircraft maintenance area are given, and the scheduling plan and the repair resources required under the repair list to be evaluated are comprehensively considered. By considering both the repair list and the repair resources, different scheduling plans are formulated, and the repair list and repair scheduling plan obtained are more reasonable and objective. BRIEF DESCRIPTION OF THE DRAWINGS

[0067] Figure 1 It is an overall framework diagram of a method for generating a battle injury repair plan based on repair resource limitation of the present invention;

[0068] Figure 2 It is a schematic diagram of a critical path algorithm in a method for generating a battle injury repair plan based on repair resource constraints according to the present invention. DETAILED DESCRIPTION

[0069] In order to make the purpose and technical solution of the embodiments of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the embodiments of the present invention.

[0070] like Figure 1 As shown, the following steps are included:

[0071] Step 1: Determine the basic emergency repair list and construct a set of pending operations, which includes several pending operations. Obtain the preceding operation, following operation, operation time and maintenance area corresponding to each pending operation.

[0072] Based on the combat damage situation, the actual maintenance area is divided, the actual maintenance area set is constructed, and the available operation start time of the actual maintenance area is obtained;

[0073] Step 2: According to the emergency repair process tree, find the schedulable job set in the job set to be scheduled; the jobs in the schedulable job set are the jobs whose immediate predecessor jobs have been completed;

[0074] Step 3: Based on the schedulable job set, an alternative scheduling scheme is obtained, which includes at least a scheduling scheme with least conflict priority, a scheduling scheme with critical path priority, a scheduling scheme with longest job priority, and a scheduling scheme with personnel idleness priority;

[0075] In scheduling planning, since maintenance operations with shorter operation time usually require fewer repair resources and occupy less time in the maintenance area, they are not easy to conflict with other operations. Therefore, the operation with the shortest operation time is scheduled first, that is, in the order of the repair process tree, the maintenance operation with the shortest operation time is scheduled first. When there are multiple maintenance operations with the shortest operation time, the maintenance operation with the longest path length is scheduled first, reducing the dominant role of operations on non-critical paths in scheduling to prevent maintenance operations on critical paths from being delayed.

[0076] The method to obtain the least conflicting priority scheduling scheme is:

[0077] S1.1 Filter out the jobs with the least conflicts in the schedulable job set and give priority to scheduling; the screening conditions are:

[0078] Compare the operation time of the jobs in the schedulable job set, and select the schedulable job with the shortest operation time as the job with the least conflict and priority;

[0079] If there are multiple schedulable jobs with the shortest operation time, they will be used as the jobs with the least conflict and priority to be scheduled. The completion paths of all the jobs with the least conflict and priority to be scheduled are obtained, and the job with the longest completion path and the least conflict and priority to be scheduled is selected as the job with the least conflict and priority to be scheduled.

[0080] S1.2 Calculate the estimated start time of the priority scheduling operation with the least conflict based on the available start time of the maintenance area corresponding to the priority scheduling operation with the least conflict and the start time of the immediately preceding operation of the priority scheduling operation with the least conflict;

[0081] S1.3 Find the maintenance work that conflicts with the priority scheduling work with the least conflict under the estimated start time, update the estimated start time to the earliest time without conflict, and determine it as the actual start time of the priority scheduling work with the least conflict; that is, if there are conflicting works, arrange the completion time of the conflicting works from small to large, find the earliest start time that satisfies the personnel resources, and use it as the actual start time;

[0082] S1.4 calculates the actual completion time of the priority scheduling operation with the least conflicts, and updates the start time of the maintenance area corresponding to the priority scheduling operation with the least conflicts;

[0083] S1.5 delete the least conflicting priority scheduling job from the set of schedulable jobs;

[0084] S1.6 Repeat steps S1.1-S1.5 until the set of schedulable jobs becomes an empty set;

[0085] S1.7 obtains the actual start time and actual completion time of each schedulable job, and outputs the priority scheduling plan with the least conflicts.

[0086] The emergency repair plan generation algorithm with the highest priority for critical operations gives priority to the maintenance operations in the dynamic critical path in scheduling planning, that is, in the order of the emergency repair process tree, attention is paid to the maintenance operations that play a key role in the entire emergency repair list. When there are multiple critical maintenance operations, priority is given to scheduling the maintenance operations with the longest operation time to speed up the progress of the entire emergency repair operation. Since the critical path in the emergency repair list is extremely important, its duration determines the minimum time required to complete the emergency repair list. The operations on the critical path play a key role in the completion progress of the emergency repair list and are the weak link of the entire emergency repair list. Therefore, this emergency repair plan generation algorithm is also called the reliability optimal emergency repair plan generation algorithm.

[0087] The method to obtain the critical path priority scheduling plan is:

[0088] S2.1 Calculate the critical path set in the basic emergency repair list; the method for calculating the critical path set is:

[0089] Get the earliest start time, latest completion time and latest start time of all jobs to be scheduled;

[0090] Based on the earliest start time and the latest start time, the time difference of all jobs to be scheduled is calculated, and the total time difference set of jobs is constructed; Figure 2 As shown, the to-be-scheduled jobs with a time difference of 0 are screened in the total time difference set of jobs and defined as critical nodes; all the immediate predecessor jobs of the critical nodes are obtained to generate a critical path forest; based on the critical path forest, all critical paths are obtained through a depth-first search algorithm to construct a critical path set.

[0091] S2.2 based on the critical path set and the schedulable job set, select the critical path priority scheduling jobs;

[0092] The method for obtaining the critical path priority scheduling job is as follows:

[0093] If the critical path set contains only one critical path, the starting job of the critical path will be used as the critical path priority scheduling job;

[0094] If the critical path set contains only N critical paths, the starting jobs and their operation times of all critical paths are obtained, and the starting job with the largest operation time is used as the priority scheduling job of the critical path.

[0095] S2.3 Calculate the estimated start time of the critical path priority scheduling operation based on the start time of the maintenance area corresponding to the critical path priority scheduling operation and the start time of the immediate predecessor operation of the critical path priority scheduling operation;

[0096] S2.4 Find the maintenance work that conflicts with the critical path priority scheduling work under the estimated start time, update the estimated start time to the earliest time that does not conflict, and determine it as the actual start time of the critical path priority scheduling work; that is, if there are conflicting works, arrange the completion time of the conflicting works from small to large, find the earliest start time that satisfies the personnel resources, and use it as the actual start time;

[0097] S2.5 calculates the actual completion time of the critical path priority scheduling operation and updates the maintenance area start time corresponding to the critical path priority scheduling operation;

[0098] S2.6 delete the critical path priority scheduling job from the schedulable job set;

[0099] S2.7 Repeat steps S2.1-S2.6 until the set of schedulable jobs becomes an empty set;

[0100] S2.8 obtains the actual start time and actual completion time of each schedulable task, and outputs the critical path priority scheduling plan.

[0101] In the entire repair list, the repair operation with the longest operation time occupies the most repair time resources and the most repair personnel resources in the entire repair. Therefore, the operations with longer operation time can be scheduled first. In addition, we also need to consider the impact of critical path operation scheduling and reduce the dominant role of operations on non-critical paths in scheduling. The method of the longest operation priority scheduling scheme is:

[0102] S3.1 Select the longest job from the schedulable job set and schedule it first;

[0103] S3.2 Calculate the estimated start time of the longest operation priority scheduling operation based on the available start time of the maintenance area corresponding to the longest operation priority scheduling operation and the start time of the immediately preceding operation of the longest operation priority scheduling operation;

[0104] S3.3 Find the maintenance work that conflicts with the longest work priority scheduling work under the estimated start time, update the estimated start time to the earliest time that does not conflict, and determine it as the actual start time of the longest work priority scheduling work; that is, if there are conflicting works, arrange the completion time of the conflicting works from small to large, find the earliest start time that satisfies the personnel resources, and use it as the actual start time;

[0105] S3.4 calculates the actual completion time of the longest operation priority scheduling operation, and updates the maintenance area start time corresponding to the longest operation priority scheduling operation;

[0106] S3.5 The longest job is preferentially scheduled and deleted from the set of schedulable jobs;

[0107] S3.6 Repeat steps S3.1-S3.5 until the set of schedulable jobs becomes an empty set;

[0108] S3.7 obtains the actual start time and actual completion time of each schedulable job, and outputs the longest job priority scheduling plan.

[0109] The emergency repair plan generation algorithm with the least idle personnel and the highest priority gives priority to maintenance operations that meet the personnel resource constraints in scheduling planning. When there are multiple maintenance operations that meet the constraints, the maintenance operations with the longest path length are scheduled first to prevent the maintenance operations on the critical path from being delayed. Since the first three emergency repair plan generation algorithms give priority to the time resources of maintenance operations, the corresponding maintenance operations will be postponed in the event of a conflict in personnel resources. During the postponed waiting time, some personnel resources will be idle, that is, the personnel resources are not fully utilized. However, under the scheduling strategy of the emergency repair plan generation algorithm with the least idle personnel and the highest priority, the personnel resources involved in the emergency repair are kept in a working state as much as possible, which increases the utilization rate of personnel resources.

[0110] The method of personnel idle priority scheduling is:

[0111] S4.1 obtains the working status, required maintenance operations and completion time of each actual maintenance area, obtains personnel resource data, and selects personnel idle priority scheduling operations in the schedulable operation set; the selection method of personnel idle priority scheduling operations is:

[0112] Based on the working status and required maintenance jobs of each actual maintenance area, the actual maintenance area with working status 0 is screened and all jobs in it are obtained, which are defined as the idle job set. Based on the personnel resources, all idle jobs that meet the personnel resource requirements are screened from the idle job set and recorded as personnel idle alternative priority scheduling jobs.

[0113] Calculate the completion path of all idle alternative priority scheduling jobs, the range of which is from the idle alternative priority scheduling job to the final job without a subsequent job; the idle alternative priority scheduling job corresponding to the longest completion path is the idle priority scheduling job.

[0114] S4.2 Calculate the actual start time and actual completion time of the personnel idle priority scheduling operation;

[0115] S4.3 delete the idle priority scheduling task of the personnel from the set of schedulable tasks;

[0116] In S4.4, the personnel resources required for the personnel idle priority scheduling operation are deleted and the remaining personnel resources are updated;

[0117] S4.5 repeat steps S4.1-S4.4 until the set of schedulable jobs becomes an empty set;

[0118] S4.6 Update system time, release personnel resources required for completed maintenance work to update remaining personnel resources;

[0119] S4.7 Repeat steps S4.1-S4.6 until the set of jobs to be scheduled becomes an empty set;

[0120] S4.8 obtains the actual start time and actual completion time of each schedulable job, and outputs a personnel idle priority scheduling plan.

[0121] Step 4: Four repair scheme algorithms combine different repair lists and different repair resources to provide decision makers with a variety of aircraft battle damage repair schemes. At the same time, under their respective performance indicators, various aircraft battle damage repair schemes have their own advantages and disadvantages when facing different aircraft battle damage situations. However, due to the complexity of the battlefield environment and the urgency of wartime tasks, the shortest time and highest priority strategy is finally used to recommend a plan to decision makers, and the shortest overall aircraft battle damage repair time is recommended, that is, the best time repair list, repair resource allocation, and repair scheduling plan.

[0122] The above is only an embodiment of the present invention, and its description is relatively specific and detailed, but it cannot be understood as limiting the scope of the patent of the present invention. It should be pointed out that for ordinary technicians in this field, several modifications and improvements can be made without departing from the concept of the present invention, which all belong to the protection scope of the present invention.

Claims

1. A method for generating a battle damage repair plan based on repair resource constraints, characterized in that: The following steps are involved: Step 1: Determine the basic emergency repair list and construct a set of pending operations, which includes several pending operations. Obtain the preceding operation, following operation, operation time and maintenance area corresponding to each pending operation. Based on the combat damage situation, the actual maintenance area is divided, the actual maintenance area set is constructed, and the available operation start time of the actual maintenance area is obtained; Step 2: According to the emergency repair process tree, find the schedulable operation set in the set of operations to be scheduled; Step 3: Based on the schedulable job set, obtain an alternative scheduling solution. These include at least the least conflict priority scheduling plan, the critical path priority scheduling plan, the longest operation priority scheduling plan and the personnel idle priority scheduling plan; The method for obtaining the least conflicting priority scheduling scheme is: S1.

1. Filter out the jobs with the least conflicts in the schedulable job set and schedule them first; S1.

2. Calculate the estimated start time of the priority scheduling operation with the least conflict based on the start time of the maintenance area corresponding to the priority scheduling operation with the least conflict and the start time of the immediately preceding operation of the priority scheduling operation with the least conflict; S1.

3. Find the maintenance work that conflicts with the priority scheduling work with the least conflict under the estimated start time, update the estimated start time to the earliest non-conflicting time, and determine it as the actual start time of the priority scheduling work with the least conflict; S1.

4. Calculate the actual completion time of the priority scheduling operation with the least conflicts, and update the start time of the maintenance area corresponding to the priority scheduling operation with the least conflicts; S1.5, deleting the priority scheduling job with the least conflict from the set of schedulable jobs; S1.6, repeat steps S1.1-S1.5 until the set of schedulable jobs becomes an empty set; S1.

7. Obtain the actual start time and actual completion time of each schedulable job, and output the scheduling plan with the least conflict and priority; Among them, the screening conditions for scheduling jobs with the least conflicts first are: Compare the operation time of the jobs in the schedulable job set, and select the schedulable job with the shortest operation time as the job with the least conflict and priority; If there are multiple schedulable jobs with the shortest operation time, they are selected as the jobs with the least conflict and priority to be scheduled. The completion paths of all the jobs with the least conflict and priority to be scheduled are obtained, and the job with the longest completion path and priority to be scheduled is selected as the job with the least conflict and priority to be scheduled. The method to obtain the critical path priority scheduling plan is: S2.

1. Calculate the critical path set in the basic repair list; S2.2, based on the critical path set and the schedulable job set, select the critical path priority scheduling jobs; Among them, the method for obtaining the critical path priority scheduling job is: If the critical path set contains only one critical path, the starting job of the critical path will be used as the critical path priority scheduling job; If the critical path set contains only N critical paths, then the starting jobs and their operation times of all critical paths are obtained, and the starting job with the largest operation time is used as the priority scheduling job of the critical path; S2.3, calculate the estimated start time of the critical path priority scheduling operation based on the start time of the maintenance area corresponding to the critical path priority scheduling operation and the start time of the immediate predecessor operation of the critical path priority scheduling operation; S2.

4. Find the maintenance work that conflicts with the critical path priority scheduling work under the estimated start time, update the estimated start time to the earliest time that does not conflict, and determine it as the actual start time of the critical path priority scheduling work; S2.

5. Calculate the actual completion time of the critical path priority scheduling operation and update the maintenance area start time corresponding to the critical path priority scheduling operation; S2.6, deleting the priority scheduling job of the critical path from the set of schedulable jobs; S2.7, repeat steps S2.1-S2.6 until the set of schedulable jobs becomes an empty set; S2.

8. Obtain the actual start time and actual completion time of each schedulable operation, and output the critical path priority scheduling plan; The method for calculating the critical path set is: Get the earliest start time, latest completion time and latest start time of all jobs to be scheduled; Calculate the time difference of all jobs to be scheduled based on the earliest start time and the latest start time, and build a total time difference set of jobs; Selecting the to-be-scheduled jobs with a time difference of 0 from the total time difference set of jobs, and defining them as key nodes; Obtain all the preceding tasks of the critical node and generate a critical path forest; Based on the critical path forest, all critical paths are obtained through the depth-first search algorithm to build a critical path set; The method of the longest job first scheduling scheme is: S3.

1. Select the longest job from the schedulable job set and schedule it first; S3.2, calculate the estimated start time of the longest operation priority scheduling operation based on the available start time of the maintenance area corresponding to the longest operation priority scheduling operation and the start time of the immediately preceding operation of the longest operation priority scheduling operation; S3.

3. Find the maintenance operation that conflicts with the longest operation priority scheduling operation under the estimated start time, update the estimated start time to the earliest non-conflicting time, and determine it as the actual start time of the longest operation priority scheduling operation; S3.4, calculate the actual completion time of the longest operation priority scheduling operation, and update the maintenance area corresponding to the longest operation priority scheduling operation. S3.5, deleting the longest job from the set of schedulable jobs; S3.6, repeat steps S3.1-S3.5 until the set of schedulable jobs becomes an empty set; S3.7, obtain the actual start time and actual completion time of each schedulable job, and output the longest job priority scheduling plan; The method of personnel idle priority scheduling is: S4.

1. Obtain the working status, required maintenance work and completion time of each actual maintenance area, obtain personnel resource data, and select the work with idle personnel in the schedulable work set to prioritize the work; S4.2, calculate the actual start time and actual completion time of the personnel idle priority scheduling operation; S4.3, deleting the idle priority scheduling task of the personnel from the set of schedulable tasks; S4.4, among the personnel resources, delete the personnel resources needed for the personnel idle priority scheduling operation, and update the remaining personnel resources; S4.5, repeat steps S4.1-S4.4 until the set of schedulable jobs becomes an empty set; S4.6, update the system time, release the personnel resources required for the completed maintenance work to update the remaining personnel resources; S4.7, repeat steps S4.1-S4.6 until the set of jobs to be scheduled becomes an empty set; S4.8, obtain the actual start time and actual completion time of each schedulable operation, and output the personnel idle priority scheduling plan; Among them, the screening method for personnel idle priority scheduling operations is: Based on the working status and required maintenance jobs of each actual maintenance area, the actual maintenance area with working status 0 is screened and all jobs in it are obtained, which are defined as the idle job set. Based on the personnel resources, all idle jobs that meet the personnel resource requirements are screened from the idle job set and recorded as personnel idle alternative priority scheduling jobs; Calculate the completion paths of all idle candidate priority scheduling jobs, where the range of the completion paths is from the idle candidate priority scheduling job to the final job without a subsequent job; the idle candidate priority scheduling job corresponding to the longest completion path is the idle candidate priority scheduling job; Step 4: Based on the above alternative scheduling schemes, according to the shortest time and highest priority strategy, select the alternative scheduling scheme that takes up the least time resources, and output the corresponding final emergency repair list and final emergency repair resources.

2. The method for generating a battle damage repair plan based on repair resource constraints according to claim 1, characterized in that: If there are conflicting tasks, arrange the completion times of the conflicting tasks from small to large, find the earliest start time that satisfies the personnel resources, and use it as the actual start time.

Images