| 摘要 |
A method is provided for generating a feasible schedule for n jobs given a duration and a revisit time for each job. The method comprises determining whether it is impossible to generate a feasible schedule, determining whether a round robin schedule is possible, calculating theoretical probabilities, calculating actual probabilities, creating a potential schedule based on the theoretical probabilities and the actual probabilities, and searching for a feasible schedule from the potential schedule.
|
