Optimization of the Electronic Queuing System Based on the LJSF Online Scheduling Algorithm

The work is devoted to optimizing the operation of the electronic queuing system of branches of one of the queuing banks using the online scheduling algorithm LJSF (Large Jobs and Safety Factor). Electronic queue planning is considered as an online model of scheduling theory with deadlines and an objective function based on them. Deadlines are determined by the recovery rate set by the bank's representatives. It is proposed to adapt the SF (Safety Factor) and LJSF (Large Jobs Safety Factor) algorithms, taking into account the priorities of the client's requests. The obtained algorithms were tested on synthetic data and on bank data. In both cases, the proposed algorithms show an improvement of more than 8%.