Accounting for large jobs for a single-processor online model

Abstract

The paper proposes for consideration an online scheduling model for single processor with a deadlines and minimization of the total delay. A new LJSF algorithm has been proposed that takes into account the size of the jobs entering the process and is adapted to cases of large jobs. In comparison with existing algorithms, LJSF improved the results on average by 3% - 20% in more than 40% of examples for different testing groups, while in other cases the values of the objective functions were close with a deviation of no more than 2%.