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)): ?>

Pavlov A.A., Misura E.B.

The PDC-algorithm for solving the problem of minimizing total weighted tardiness of jobs is based on directed permutations implementing the use of reserves of nontardy jobs by tardy jobs. In this article the properties and signs of optimality are given for the solutions that are obtained during execution of the algorithm. The types of permutations are described and the rules of their execution are justified that allow to highly shrink the area of search for the optimal solution and to exclude the unpromising solutions.

Full text (pdf)