Online models and algorithms for scheduling without interruption on parallel processors

Tarasova Elizaveta

The purpose of this work is to study online models of uninterrupted scheduling theory and scheduling algorithms for them. The paper presents an overview of methods for tasks with different objective functions on parallel processors and for tasks with a due date. On the generated data, the MINDL and SPT algorithms were run to minimize the total delay. As a result of the comparison, it was revealed that the algorithms get similar results, except for examples with additional complications.

Keywords:online planning models; model without interruptions; directive term, model on parallel processors; minimization of the total delay.