schedule is allocated to any resource therefore the possibility of successful allocation of resources to the overall schedule group becomes higher so long as the sequence of allocation of lower degree schedule is less prioritized when there is no schedule a whose degree is less than the number of candidates for available resources no in step s 202 processing proceeds to step s 207 when such a schedule a is present yes in s 202 a edge is made to the schedule a a schedule b whose degree has not yet been updated is searched step s 203 when such a schedule b is present yes in step s 204 the degree of the schedule b is reduced by an amount corresponding to the combination of resource patterns of the schedules a and b and the degree of the schedule b is taken as having been updated step s 205 when such a schedule b is not present no in step s 204 the schedule a is handled as being deleted from the network the thus deleted schedule is stacked step s 206 and processing returns to step s 201 supplemental descriptions will be provided later in connection with the weight of the combination of the resource patterns in degree computation the expression u201c a schedule is handled as being deleted from the network u201d signifies means for setting a flag so.