<div class="description">
<dl><dd>Title from cover</dd>
<dd>"January 1973"--Cover</dd>
<dd>"NPS-55HK73011A"--Cover</dd>
<dd>Author(s) subject terms: Sequencing, job shop scheduling, investigation</dd>
<dd>Includes bibliographical references (p. 22)</dd>
<dd>Technical report; 1973</dd>
<dd>The investigation problem considered here is one in which there is an investigator in a region with several objects, all of which are attempting to cross a specific boundary of the region. The investigator is to investigate as many of the objects as possible before they cross the boundary. In this paper it is assumed that all objects are moving parallel to one another directly toward the boundary. The investigator has speed greater than the objects, and can change his course instantaneously. Forty sample problems with 20 objects each were randomly generated and solved optimally using branch and bound methods previously developed by the authors. In the first twenty problems, all targets have the same speed. In the second set of twenty problems, the target speeds differ. Solutions for the same problems were obtained through application of three easily implemented "rules of thumb." The effectiveness of each rule of thumb is determined through comparison of results with the optimal solutions. (Author)</dd></dl><br>Subjects: GAMES OF STRATEGY (MATHEMATICS)</div>
<div class="fn value">
Balut, Stephen John.Howard, Gilbert Thoreau, 1941-</div>
<dl><dd><a rel="nofollow" class="external free" href="https://archive.org/details/comparisonofthre00balu">https://archive.org/details/comparisonofthre00balu</a></dd>
<dd><a rel="nofollow" class="external free" href="https://archive.org/download/comparisonofthre00balu/comparisonofthre00balu.pdf">https://archive.org/download/comparisonofthre00balu/comparisonofthre00balu.pdf</a></dd></dl>