Отправить статью по E-mail A metric for total tardiness minimization
- Авторы: Lazarev A.A.1,2,3,4, Korenev P.S.1,2, Sologub A.A.1,2
-
Учреждения:
- Trapeznikov Institute of Control Sciences
- Lomonosov State University
- Moscow Institute of Physics and Technology
- Higher School of Economics (National Research University)
- Выпуск: Том 78, № 4 (2017)
- Страницы: 732-740
- Раздел: Large Scale Systems Control
- URL: https://journals.rcsi.science/0005-1179/article/view/150585
- DOI: https://doi.org/10.1134/S0005117917040142
- ID: 150585
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
In this paper we consider the NP-hard 1|rj|ΣTj scheduling problem, suggesting a polynomial algorithm to find its approximate solution with the guaranteed absolute error. The algorithm employs a metric introduced in the parameter space. In addition, we study the possible application of such an approach to other scheduling problems.
Об авторах
A. Lazarev
Trapeznikov Institute of Control Sciences; Lomonosov State University; Moscow Institute of Physics and Technology; Higher School of Economics (National Research University)
Автор, ответственный за переписку.
Email: jobmath@mail.ru
Россия, Moscow; Moscow; Moscow; Moscow
P. Korenev
Trapeznikov Institute of Control Sciences; Lomonosov State University
Email: jobmath@mail.ru
Россия, Moscow; Moscow
A. Sologub
Trapeznikov Institute of Control Sciences; Lomonosov State University
Email: jobmath@mail.ru
Россия, Moscow; Moscow
Дополнительные файлы
