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

Sperkach M.

This article studies the properties of the problem of scheduling tasks with a common tough due date on parallel machines with different speeds to maximize the launch moment of the machines with the condition that all the tasks are not delayed. An auxiliary optimization problem is formulated, the results of which are the sufficient conditions for a schedule optimality. On their basis the set of permutations is defined that allow to consistently improve the criterion value. The polynomial component of PDC-algorithm for the problem solution is developed.

Full text (pdf)