Enviar artigo por via de e-mail A metric for total tardiness minimization
- Autores: Lazarev A.A.1,2,3,4, Korenev P.S.1,2, Sologub A.A.1,2
-
Afiliações:
- Trapeznikov Institute of Control Sciences
- Lomonosov State University
- Moscow Institute of Physics and Technology
- Higher School of Economics (National Research University)
- Edição: Volume 78, Nº 4 (2017)
- Páginas: 732-740
- Seção: Large Scale Systems Control
- URL: https://ogarev-online.ru/0005-1179/article/view/150585
- DOI: https://doi.org/10.1134/S0005117917040142
- ID: 150585
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
A. Lazarev
Trapeznikov Institute of Control Sciences; Lomonosov State University; Moscow Institute of Physics and Technology; Higher School of Economics (National Research University)
Autor responsável pela correspondência
Email: jobmath@mail.ru
Rússia, Moscow; Moscow; Moscow; Moscow
P. Korenev
Trapeznikov Institute of Control Sciences; Lomonosov State University
Email: jobmath@mail.ru
Rússia, Moscow; Moscow
A. Sologub
Trapeznikov Institute of Control Sciences; Lomonosov State University
Email: jobmath@mail.ru
Rússia, Moscow; Moscow
Arquivos suplementares
