ИСТИНА

In this paper, we propose a new approximation scheme for scheduling problems. The scheme is based on search for the polynomially solvable instance which has a minimal distance in the metric from the original instance. One can also improve the scheme by constructing new metrics and finding new polynomially solvable cases of scheduling problems.