  We present the Flight and Maintenance Planning (FMP) problem in its military
variant and applied to long term planning. The problem has been previously
studied for short- and medium-term horizons only. We compare its similarities
and differences with previous work and prove its complexity. We generate
scenarios inspired by the French Air Force fleet. We formulate an exact Mixed
Integer Programming (MIP) model to solve the problem in these scenarios and we
analyse the performance of the solving method under these circumstances. A
heuristic was built to generate fast feasible solutions, that in some cases
were shown to help warm-start the model.
