| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To provide a system and a method for scheduling which generate an optimum schedule by only requiring a finite amount of computational processes. <P>SOLUTION: The system tentatively allocates a job in the order of allocation priority, each of which is selected from the jobs having no decision of resource allocations, to each resource that can process the assigned job; and generates the schedule with the resource tentatively allocated for the jobs in accordance with the decision by a tentative resource allocation decision unit that decides to allocate the resources to the jobs except those having the decisions of the resource allocation (S4 and S8). The system evaluates the generated schedule (S5 and S9) and decides to allocate the jobs to the resource with the highest evaluation point (S13). These processes are supposed to repeat until the allocations of resources are decided for all the jobs (S14). <P>COPYRIGHT: (C)2004,JPO</p> |
