The scientific work solves the problem of organizing a route group flight of aircraft, when pre-flight planning is carried out only for the beginning of the flight, and then operational planning is carried out by analogy with a taxi. The peculiarity of the problem being solved is to ensure the required planning efficiency during the flight of the aircraft, taking into account the safety of their flights without crossing routes. As a result of solving the problem, an approach was substantiated to solving the problem of target distribution of vacant aircraft between incoming orders, taking into account all the factors and constraints under consideration; the effectiveness of the chosen approach was assessed. A minimax scheduling criterion is proposed. The criterion at the same time provides: minimum time for completing the flight task; minimization of the total path length and non-intersection of the flight sections, which increases the efficiency and safety of flight in “peak” dispatch modes. The solution to the problem is proposed using the queuing theory, according to which the considered system belongs to the class of multichannel queuing systems with waiting.