摘要
对课表编排系统中涉及的搜索课程的可用时间集合、择优选取时间片、搜索所选定时间的空闲教室、择优选取教室以及解决冲突等环节的算法实现进行了讨论。前4个环节主要涉及时间或教室集合的搜索以及按照一定的优选策略选择最佳匹配,最后环节则利用人工智能的深度优先图搜索策略对冲突进行调整。
The usable time sets, the timeout of optimization, free classrooms, classrooms of optimization and algorithms for resolving the conflicts in the course searching involved in the courses scheduling system are discussed. The former four taches mainly involve in the searching for time and classroom sets and choosing the optimization match according to some optimum strategy. The last tache is to adjust conflicts by the deep-first graphic searching in the artificial intelligence.
出处
《计算机工程与设计》
CSCD
2004年第10期1867-1868,F003,共3页
Computer Engineering and Design
