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 PDC-algorithms for one machine scheduling problem to minimize total earliness and tardiness

Pavlov A.A., Misjura E.B.

The effective PDC-algorithms are proposed for the solution of NP-hard earliness/tardiness problem for the cases when the moment of the tasks execution start is fixed or is in the time interval [t1, tk]. The solution is based on the PDC-algorithm for the total tardiness minimization problem. A heuristic algorithm is developed to define the latest moment of the tasks execution start at which the minimal functional value is achieved. An examples of the problems solution and the results of the experiments are given.


Full text (pdf)