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

Suboptimal polynomial algorithm for solving a multistage network scheduling problem of a single class

Pavlov A.A., Sperkach M.O., Khalus E.A.

In this paper we consider one class of multistage network calendar scheduling problem. For arbitrarily given finite due dates (due dates for finished products’ release) it is necessary to obtain a feasible schedule with the latest startup time of the technological process. With the additional constraint on the structure of a feasible schedule the exact polynomial algorithm for solving the formulated problem was stated. The theoretical and practical grounding for expedience of the introduction of additional restrictions on the structure of the desirable schedule was presented.


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