| 摘要 |
PROBLEM TO BE SOLVED: To flexibly deal with the change of conditions such as the addition of a new job or the deletion of any job without changing a schedule search logic concerning the problem of scheduling for allocating plural jobs to plural elements and to find a schedule having a much better evaluation value within practical time even concerning the problem of scheduling for allocation for which the huge number of combination exist. SOLUTION: Concerning a job allocation scheduling method for defining a solution having the much better evaluation value as an optimum solution for the problem for allocating plural jobs to plural elements, the solution is found by exchanging a master schedule and a slave schedule while considering the evaluation value. In that case, any job string to be the object of exchange and any partial string in that job string are stochastically selected. Afterwards, the job string in the element is optimized. Besides, when the evaluation value of the slave schedule is better, it is exchanged with the master on no condition but even when that evaluation value is worse, the slave schedule is exchanged with the master in certain probability. This probability is calculated while using a search parameter to change corresponding to the number of times of repetition. |
