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.
1. McNaughton R. Scheduling with deadlines and loss functions. Manag. Sci. 1959;6(1):1-12.
2. Rothkopf M. Scheduling with random service times. Manag. Sci. 1966;12(9):707-713.
3. Gordon V. S., Tanaev V. S. Interrupts in deterministic systems with parallel devices and
non-simultaneous receipt of service requirements. Optimization of systems for collecting, transmitting and processing analog and discrete information in local IVS: mater. ITK ban
seminar. - Minsk, 1973:36-50.
4. Lawler E.L., Moore J.M., A functional education and its application to resource allocation
and sequencing problems, Manag. Sci. 1969;16(1):77-84.
5. Gordon V. S., Tanaev V. S., Deterministic service system with one device and step-by-step
penalty functions, Sat. «Compute. Techn. in mechanical engineering», 1971:3-8.
6. Moore J.M., An n – job, jne machine sequencing algorithm for minimizing the number of
late jobs, Manag. Sci. 1968;15(1):102-109.
7. Strum L.B. J.M., A simple optimality proof of Moore’s sequencing algorithm, Manag. Sci.
1970;17(1):116-118.
8. Sidney J.B., An extention of Moore’s due date algorithm, Lect. Notes Econ. and Math. Syst.
1973;86:393-398.
9. Emmons H., One – machine sequencing to minimize certain functions of job tardiness,
Operat. Res. 1969;17(4):701-715.
10. Srinivasan V., A hybrid algorithm for the one machine sequencing problem to minimize
total tardiness, Nav. Res. Log. Quart. 1971;18(3):317-327.
11. GOST R 53704-2009 «Сomplex security Systems and integrated. General technical
requirements».
Larisa v. rossikhina Larisa v. rossikhina Vitalievna
Doctor of Technical Sciences, Associate Professor
Email: rossihina_lv@mail.ru
Voronezh Institute of the Federal penitentiary service of Russia
Academy of management of the Ministry of internal Affairs of Russia
Voronezh, Moscow, Russian Federation
Egorov Egor Yuryevich
Email: turop_34@mail.ru
Voronezh Institute of the Federal penitentiary service of Russia
Voronezh, Russian Federation
