| 摘要 |
<p>PURPOSE:To improve the search efficiency by deciding whether a search tree is further expanded or not, and growing the search tree from a place where the number of elements with no lower bound growth is small. CONSTITUTION:When a work time managing part 33 assumes that each unallocated work is processed smoothly without being obstructed by other unallocated work, a work time table for a start time and a completion time by which the processing is executed in each process is generated. A lower bound reason prescribing part 34 generates a lower bound reason table. A competition work extracting part 21 extracts a work allocated in the next time from in the allocatable work in every process, based on the work time table and the condition of the work allocated in the next time, and generates a competition work congregation table. A competition work determining part 22 derives the number of elements in which the lower bound does not grow with regard to each competition work congregation, based on the lower bound reason table, and selects one competition work congregation in which the number of elements is the smallest. In such a way, the search can be executed efficiently.</p> |
