Resumen
The increasing number of air operations is a challenge for air traffic controllers. The organization of air traffic can be achieved by better aligning the planes for landing or sequencing. Sequencing problem is commonly found in many areas of science, industry and economics. The schedule of tasks in air transport is also important in the integration of traffic, as it allows passengers, not only direct flights, but also efficient interchanges. Generally, the problem of sequencing tasks is to determine the order of execution of tasks on machines (CPUs) so as to minimize (or maximize) the value of a given criterion. The problem of optimally determining the order of landing operations is noticeable both in official regulations and scientific publications. Aiming to develop the optimum sequencing of aircraft landing process, support procedures implemented at airports. In the early stages of air traffic sequencing, extended arrival management (AMAN) and feature-based navigation (PBN) are used to extend the planning horizon. It is possible to sequence traffic both during the flight and early descent. However, there are no universal sequencing methods. Research is still needed in this area. The article discusses the process of sequencing landing aircraft, taking into account the minimization of the schedule length. It represents the desired number of landing operations in the shortest possible time. The application of theoretical algorithms has been verified and a methodology has been developed for determining the order of landing operations, providing the shortest possible execution of all operations. On the basis of the computerized algorithm of sequencing landing aircraft with regard to the minimization of the ranking, calculations were made to check the validity of the algorithm. The results were compared with the times achieved using probabilistic sequencing problems.