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., Sperkach M.O.

In the article the properties of the problem are researched to build a feasible schedule of tasks execution with a common due date for parallel machines with two simultaneous criteria of optimality: total earliness minimization regarding the due date and the tasks’ start time execution maximization. The sufficient conditions of schedule’s optimality are developed. The PDC-algorithm for the solution of the problem is given.

Завантажити (pdf)