Using genetic algorithms for optimal ordering problem of flight test maneuvers;

The ordering of the basic events is crucial to the size of the resulting BDD and the analysis speed,so the optimal ordering is a key part of the analysis.

While modeling the calculation of the fuel and time of transition maneuvers between flight maneuvers, with the criterion of the minimum fuel or the time used in transition maneuvers of flight test, this paper studies the optimal ordering problem of flight test maneuvers by two methods.

In this paper, we discuss the following resource constrained scheduling problem1|p j=f j(u j),∑jw jC j≤|∑ju j Under the situation of finite task permutation, two algorithms for exploring optimal resource allocation are given, and on the conditions such as f j=f and f j=b-a ju j,w j=w, the study of optimal schedules is made.

We prove that the SPT schedule is optimal schedule.

In this paper,we put forward and discuss the following resource constrained scheduling systems1｜r_j=b_j-a_ju_j, u_j｜u_j+C_(max) Under the situation of a finite task permutation with the system,one algorithms for exploring optimal resource allocation is given and proven;and on some special conditions such as a_j=a,p_j=p,_j=,the study of optimal schedules with the system is made.

In this paper, we put forward and discuss the following resource constrained scheduling systems1|p j=f j(u j), ∑u j|∑(w jc j+u j)Under the situation of finite task permutation, three algorithms for exploring o ptimal resource allocation are given; and on the conditions such as f j=f and f j=b j+g, w j=w, the study of optimal schedules is made.