Alena Fedotova – Researcher, Department of Computer Systems in Manufacturing, Faculty of Management Information Systems, Bauman Moscow State Technical University.  
Address: 5, 2nd Baumanskaya str., Moscow, 105005, Russian Federation.  
E-mail: afedotova@acm.org

Mikhail Ovsyannikov – Associate Professor, Department of Computer Systems in Manufacturing, Faculty of Management Information Systems, Bauman Moscow State Technical University.  
Address: 5, 2nd Baumanskaya str., Moscow, 105005, Russian Federation.  
E-mail: mvo50@mail.ru

Victor Taratoukhine – Head of SAP Academic Department, Faculty of Business Informatics, National Research University Higher School of Economics; Managing Director ERCIS Competence Center ERP and head of ERCIS Lab. Russia, University of Munster, Germany.
Address: Germany, Munster, Leonardo-Campus, 3, University of Munster, ERCIS – Headquarters. 
E-mail: victor.taratoukhine@ercis.uni-muenster.de

Significance of the following research could be explained by the fact aircraft competitiveness is affected by multiple factors including Maintenance, Repair and Overhaul system. Maintenance, Repair and Overhaul (MRO) means procedures and operations to maintain good working condition of an item during its normal use, standby, storage and transportation. Main indicators to describe MRO system performance are scope and schedule of maintenance which directly affect operating costs, and aircraft utilization rate. It should be noted that requirements for MRO program in Russia are different from those in foreign countries.

This paper aims at study of planning and maintenance methods in Russian MRO practices in order to determine opportunities for scope and schedule optimization.

This article describes analysis of MRO planning methods, tasks for MRO, set-up of limitations, means of compliance with limitations, appropriate for periodic maintenance planning. Method of problem solving based on combination of brute-force and search space limitation methods is specified. As opposed to brute-force approach this method allows shortening search time by limiting the search space. Moreover this method allows scanning of all possible combinations and solutions. This algorithm involves following separate units: limitation parser, problem solver and searcher. This allows simplifying system support and extends its application field due to adjustment of algorithm in accordance with specific conditions without reprogramming.