This article is devoted to an online model of scheduling theory for tasks with due dates and minimizing the total delay. For consideration, a new algorithm is proposed that allows you to build schedules in real time for the problem condition. At the same time, a comparison is made with the natural algorithm, which is based on the target dates.
Original language
Russian
Pages (from-to)
177-181
Journal
Актуальные научные исследования в современном мире
Issue number
7-2 (63)
State
Published - 2020
Externally published
Yes
Research areas
deadlines, Online algorithms, scheduling theory, Single machine, директивные сроки, однопроцессорная модель, онлайн алгоритм, теория расписаний