Zhurovskyy M., Pavlov A., Misura E., Melnikov O., Mukha I., Lyshchuk E.

We consider NP-hard in the strong sense problem of combinatorial optimization with the criterion of minimizing the total weighted tardiness. This problem is part of the mathematical support of the four-level planning model (including operational) and decision making on its fourth level. On the basis of the properties research of the previously developed PSC-algorithm for the problem solving and the complexity study of its individual procedures, a new heuristic algorithm was created that allows to solve problems of real practical dimension. Its efficiency is investigated.