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.