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 total tardiness minimization when processing independent tasks with a common due date on the identical parallel machines with an arbitrary starting times

Pavlov A.A., Misjura E.B.

The problem of scheduling independent tasks with a common due date and equal weights in the case of arbitrary starting times of machines is considered. The PDC-algorithm to solve it is proposed. The optimality signs of the polynomial component of the algorithm are formulated. The upper bound of deviation of a solution from optimum is obtained. An example of the problem solution is given.


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