|
|
Upravlenie Bol'shimi Sistemami, 2015, Issue 57, Pages 123–137
(Mi ubs837)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Control in Social and Economic Systems
Metric for minimum total delay problem
A. A. Lazarev, P. Korenev, A. Sologub V.A. Trapeznikov Institute of Control Sciences of RAS
Abstract:
We consider the NP-hard 1|rj|PTj scheduling problem and suggest the polynomial time algorithm to find its approximate solution with the guaranteed absolute error. The algorithm employs the metric introduced in the parameter space. We also consider possible application of such an approach to the other scheduling problems.
Keywords:
scheduling theory, approximation algorithms, NPhardness, metrics.
Received: June 23, 2015 Published: September 30, 2015
Citation:
A. A. Lazarev, P. Korenev, A. Sologub, “Metric for minimum total delay problem”, UBS, 57 (2015), 123–137; Autom. Remote Control, 78:4 (2017), 732–740
Linking options:
https://www.mathnet.ru/eng/ubs837 https://www.mathnet.ru/eng/ubs/v57/p123
|
|