论文部分内容阅读
调度问题属于组合数学范畴,也是所谓的NP-hard问题,随着任务与资源量的扩大,由其组合所生成的可行方案也急剧暴涨,而遗传算法作为一种非确定性的拟生态随机优化算法在调度问题上得到了广泛的应用。
The scheduling problem belongs to the category of combinatorial mathematics, and is also called the NP-hard problem. With the expansion of the tasks and resources, the feasible solutions generated by the combination also skyrocketed. The genetic algorithm, as a kind of non-deterministic quasi-ecological stochastic optimization The algorithm has been widely used in scheduling problem.