Carrier-based aircraft maintenance tasks are conducted in time-critical, resource-constrained, and uncertain environments. Optimizing the scheduling allocation scheme of maintenance personnel and equipment, reasonably responding to uncertainty disturbances, and maintaining a high fleet availability are vital to the combat and training missions of carrier-based aircraft. The maintenance task scheduling problem for carrier-based aircraft is investigated in this study. First, a mathematical model for comprehensive carrier-based aircraft maintenance task scheduling that considers constraints such as maintenance personnel, equipment/shop, space, and parallel capacity is developed. Second, to generate the baseline scheduling scheme, an improved non-dominated sorting genetic algorithm II (I_NSGA-II) with local neighborhood search is proposed for the model optimization solution; I_NSGA-II uses the serial scheduling generation scheme mechanism to generate the time sequence scheduling scheme for maintenance personnel and equipment/workshop of different fleet sizes. Third, to cope with dynamic uncertainty disturbances, two reactive scheduling methods, i.e., complete rescheduling and partial rescheduling, are proposed to perform reactive scheduling corrections to the baseline schedule. Case simulation shows that the established mathematical model is reasonable and practical, and that the proposed I_NSGA-II is superior to the current mainstream algorithms. In addition, the decision maker can select between the two reactive scheduling methods flexibly based on the different forms and scales of disturbance.

No abstract

No abstract

It is of great significance to carry out effective scheduling for the carrier-based aircraft flight deck operations. In this paper, the precedence constraints and resource constraints in flight deck operations are analyzed, then the model of the multi-aircraft integrated scheduling problem with transfer times (MAISPTT) is established. A dual population multi-operator genetic algorithm (DPMOGA) is proposed for solving the problem. In the algorithm, the dual population structure and random-key encoding modified by starting/ending time of operations are adopted, and multiple genetic operators are self-adaptively used to obtain better encodings. In order to conduct the mapping from encodings to feasible schedules, serial and parallel scheduling generation scheme-based decoding operators, each of which adopts different justified mechanisms in two separated populations, are introduced. The superiority of the DPMOGA is verified by simulation experiments.

No abstract