فرایند فرود هواپیما به منظور به حداقل رساندن طول برنامه

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.