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

Drawing up a feasible schedule of jobs on one machine in order to minimize the total earliness of jobs

Pavlov A.A., Khalus E.A.

We consider a scheduling problem of independent tasks execution with arbitrary durations and various due dates on a single machine by minimizing the total earliness and finding the maximum startup time of the tasks in a feasible schedule. The exact polynomial algorithms are proposed.


Full text (pdf)