A Branch and Bound Algorithm for Statistical Studies of a New PDC-Algorithm for Solving the Single Machine Total Tardiness Weighted Tardiness Problem | Visnyk NTUU "KPI" : Informatics, operation and computer science

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

A Branch and Bound Algorithm for Statistical Studies of a New PDC-Algorithm for Solving the Single Machine Total Tardiness Weighted Tardiness Problem

Shevchenko K.Y.

Provided here is a state-of-the-art survey of research results on minimizing total weighted tardiness of processing jobs on a single machine. We suggest an effective branch-and-bound algorithm for solving this problem and which is intended to be used in statistical studies of characteristics of new PDC-algorithm.

Full text (pdf)