?
A metric for total tardiness minimization
Automation and Remote Control. 2017. Vol. 78. No. 4. P. 732-740.
Лазарев А. А., Коренев П. С., Sologub A. A.
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.