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

The problem of creating a feasible schedule with maximum late moment of starting the jobs with common due date on identical parallel machines

Pavlov A.А., Zhdanova O.G., Sperkach M.O.

The article describes the properties research of the problem of creating a feasible schedule of jobs with the common due date on identical parallel machines with a maximum late start. Applying the methodology of PDC-algorithms the signs of optimal schedules are developed, which are defined on the basis of the permutations set that allow to consistently improve the value of the criterion. The polynomial component of the PDC-algorithm for the problem solution is developed. A practical application of the developed algorithm is considered. The experimental studies of the algorithm is given.


Full text (pdf)