Estimations of an absolute error and the scheme of the approached solution problems of the scheduling theory

Abstract

For single and multi-machine scheduling problems with the criterion of minimization maximum lateness the metrics ρ has been used for the first time. A theorem of estimating the absolute error has been proved. The idea of the offered approach consists in construction by an initial instance of a problem of other instance for which it is possible to find the optimum or approximated solution, with the minimal distance up to an initial instance in entered metric.