Optimal Resource Management оn Preparing a Group of Similar Aircrafts for Operation

The work is devoted to solving the problem of finding the minimum composition of a team of specialists and general ground handling facilities (equipment), as well as distribution in the process of preparing the required group of aircrafts for use within a given time. To justify the minimum composition of the team and the necessary equipment, it is necessary to solve the problem of forming a job schedule for a group of aircrafts, a distinctive feature of which is to take into account a number of restrictions, caused by the interaction of specialists and equipment, as well as the order and incompatibility in time of some jobs. This, in turn, requires consideration of a huge number of options for organizing the work performed on each aircraft, and scheduling options for servicing several aircrafts by one specialist. The problem of substantiating the minimum composition of specialists and equipment is based on the use of combinatorial optimization methods, i.e. the construction of possible solutions, the number of which is reduced by using the branch-and-cut method. The article proposes a mixed integer linear programming model with binary variables to find the optimal solution and a software implementation that does not require large computational resources. It is given and analyzed in detail an example of finding the optimal team of specialists who prepare a group of six aircrafts, each of which performs five types of work. The reasonable solution time to find the schedule for a given team made it possible to consider all possible options for the composition of the team (tens of thousands of options) and justify such an option in which the number of specialists in the team would be minimal, but they would ensure the preparation of the aircraft within a given time. When solving a problem, an exact schedule is found for each considered variant of the team composition. Further development of this approach is based on discrete time models; preliminary studies show the possibility of finding the optimal schedule for preparing a group of 30 aircraft for up to 5 seconds.

1. Yablonskij S. N., Yakovyshenko O. V., Shumskij A. V. Engineering and aviation support of combat operations and combat training of aviation units of the Armed Forces: a textbook for engineering and technical universities of the Air Force, Edited by Yablonskij S. N., Moscow, Isd. VVIA im. Prof. N.E Zhukovskogo i Yu. A. Gagarina, 2009, 300 p. (in Russian)

2. Shpilev K. M. ed. Engineering and aviation service, maintenance and repair of aviation equipment, Moscow, Voenizdat, 1979 (in Russian).

3. Shpilev K. M., Sidyaev N. M. Engineering and aviation service and aircrafts operation, Edited by Sidyaev N. M., Moscow, Voenizdat, 1970 (in Russian).

4. Novikov I. A., Romanov N. M., Stepanov S. V. Operation of military aircraft, Edited by Philippov V. V., Moscow, Publishing house of VVIA im. Prof. N. E Zhukovskogo, 1982 (in Russian).

5. Efimenko A. F, Kovalyuk N. P. Operation of military aircraft: a textbook for engineering and technical universities of the Air Force, Edited by Kuznecova M. Y., Moscow, Publishing house of VVIA im. Prof. N. E Zhukovskogo, 1999 (in Russian).

6. Pisarev V. N. Application of queuing theory in the tasks of aviation and engineering suppor, Moscow, Publishing house of VVIA im. Prof. N. E Zhukovskogo, 1965 (in Russian).

7. Lazarev A. A., Gafarov E. F. Theory of schedules. Tasks and Algorithms, Moscow, Publishing house of MGU im. M. V. Lomonosova, 2011, 222 p. (in Russian).

8. Portugal V. M., Semyonov A. I. Theory of schedules, Moscow, Znanie, 1972. 64 p. (in Russian).

9. Brucker P. Scheduling algorithms, New York, Springer, 2007, 379 p.

10. Mathematical models of problems of optimal planning of pre-flight preparation of aircraft, available at: https://pandia.ru/text/80/171/33237.php/date of application 26/08/2023.

11. Algorithms for solving problems of optimal planning of pre-flight preparation of aircraft, available at: https://gigabaza.ru/doc/177593.html/ data of application 30/08/023.

12. Buryak Yu. I, Skrynnikov A. A. The algorithm of rational planning and allocation of resources in the task of preparing a group of aircraft for use, Mekhatronika, Automatizatsiya, Upravlenie, 2019, vol. 20, no.5, pp. 314—320 (in Russian).

13. Buryak Yu. I., Skrynnikov A. A. The algorithm of rational planning and allocation of resources in the preparation of a group of aircraft for use in conditions of uncertainty, Mekhatronika, Automatizatsiya, Upravlenie, 2020, vol. 21, no. 6, pp. 375—382 (in Russian).

14. Melnikov B. Ph., Melnikova E. A. About the classical version of the branch and boundary method, Computer tools in education, 2021, no. 1, pp. 21—44 (in Russian).

15. Gonzales T., Sahni S. Open Shop Scheduling to Minimize Finish Time, Journal of the ACM, 1977, vol. 23, iss. 4, pp. 665—679.

16. Phillips D. T., Garcia-Diaz A. Fundamentals of network analysis, Prentice Hall, 1981.

17. Birkhoff G., Bartee T. C. Modern applied algebra, Mc-Graw-Hill, 1970.

18. Fourer R., Gay D. M., Kernighan B. W. AMPL: A Modeling Language for Mathematical Programming, Duxbury, Thompson, 2003.

19. Wolsey L. Integer Programming, John Wiley & Sons, 2021.

20. NEOS Server for Optimization, available at: https://neosserver.org/neos/ (date of access 20.01.2024).

21. IBM ILOG CPLEX Optimization Studio, IBM Corp., 2012.

22. Gurobi Optimizer 9.0 Reference Manual, Gurobi Optimization LLC, 2020.