MULTI-ASSORTMENT OPTIMIZATION OF REVERSIBLE FUND’S SIZE BASED ON RECURSION METHOD WITH THE AGGREGATE REPAIR METHOD

Abstract

Effective management of the reversible fund of spare parts requires appropriate software solutions. These are currently available, but the main constraint that prevents the widespread introduction of these tools into management practice is their inherent significant drawback – the traditionally low level of computing performance and reliability. The reason is an iterative algorithmic kernel, which, on the one hand, causes a low level of processing speed due to a large amount of redundant computational work, and on the other hand, generates a problem of «large» numbers, leading to both incorrect results and emergency stops of calculations because of overflow of the bit grid. During multi-assortment optimization of reversible fund’s size, the indicated problems almost completely paralyze the computational process. In this regard, the development of an alternative solution, devoid of the listed disadvantages, is relevant. For this, the author of the article proposed and developed a recursive algorithmic kernel that completely eliminates all the indicated defects of the existing solutions. Purpose – increasing the computing performance and reliability of software solutions for management by the reversible fund of spare parts. Method or methodology of the work: recursion and recurrence method. Results: software and algorithms for multi-assortment optimization of reversible fund’s size based on recursion method with the aggregate repair method. Practical implications: financial management.

Keywords

• многономенклатурная оптимизация
• оборотный фонд
• агрегатный метод ремонта
• рекурсия