DEVELOPMENT OF OPTIMIZATION ALGORITHMS SERVICING REQUESTS FOR REPAIR OF ELEMENTS INTEGRATED SECURITY SYSTEM
L.V. Rossikhina, Е.Y. Egorov
The article presents an algorithm for servicing the largest number of requests for repair of elements of the integrated security system (ICS) within the specified time frame. The peculiarity of the algorithm is that the Directive service period is the active recovery time of the HMB, which is defined in GOST R 53704-2009 «Security systems are complex and integrated. General technical requirements». An algorithm for constructing an optimal sequence of servicing repair requests is also proposed. The optimal sequence is determined based on the lowest total delay time in completing service requests within the policy time frame. The task of building schedules for servicing requests is analyzed subject to specified policy deadlines and penalties for violating certain policy deadlines. The issues of minimizing the number of applications served were also considered with delay and generalization of priority intervals for servicing requests for repair of HMB elements. The article presents two approaches to optimizing service requests for repair of elements of the ISF. The first algorithm provides the ability to service the largest number of repair requests during the active recovery time of the HMB. The second algorithm provides an opportunity to obtain an optimal sequence for servicing requests for repair of HMB elements, taking into account the total delay time at the end of the service within the specified time frame.
Keywords: algorithm, criterion, sequence, repair request, Directive maintenance period, actual service completion time, active recovery time of the HMB.