post_parent): $temp_content = $post->post_content; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[1]; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[0]; $temp_content = strip_tags($temp_content); $temp_content = trim($temp_content); $authors = explode(",",$temp_content); ?> post_title));?>"> $value): ?> "> "> "> post_content); while ($parser->parse()) { if (($parser->iNodeName=="a")&&(substr_count($parser->iNodeAttributes['href'],".pdf")>0)): ?>

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.

Download(pdf)