A Kind of Examination Timetabling Algorithm under Condition of Limited Resource

摘要：

Examination timetabling algorithm is the premise to solve heavy resource scheduling and processing work. The paper presented a kind of examination timetabling algorithm under limited resource condition. The algorithm is based on priority and weight, combing with backtracking and greedy methods. Local overall planning idea was also utilized to achieve resource simplification and efficiency improvement of automatic examination timetabling. Application of the algorithm in practical timetabling process shows that the algorithm is quite effective in solving complex problems in automatic examination timetable under condition of limited resource.

关键词： timetabling limited resource backtracking greedy local overall planning

作者: Yang Yan-ping Yu Hong kui Kang Yan Liu Yan

作者单位: Hebei Normal University of Science and Technology Qinghuangdao, China

会议类型: 国际会议

会议名称: 2011 International Conference on Innovation and Information Management(2011年IEEE创新与信息管理国际会议 ICIIM2011)

会议地点: 成都

会议语种:英文

页码: 9-11

在线出版日期: 2011-01-14（万方平台首次上网日期，不代表论文的发表时间）