| 摘要 |
This disclosure concerns the iterative optimisation of schedules, such as calendars. A computer system receives or determines first candidate schedule items. Each candidate schedule item has parameters, and each parameter is fixed or variable and each candidate schedule item comprises a value for each parameter. The system determines second candidate schedule items by permutating the variable parameters of each of the first candidate schedule items and determines a cost for each of the second candidate schedule items. The system then selects a subset of the second candidate schedule items based on the cost and feeds back the subset to be taken as the first candidate schedule items. Since each parameter has a value the cost for each permutation can be determined and the number of candidate schedule items for the next iteration can be reduced. This avoids the exponential complexity of calculating the cost for each possible combination. |
