Title :
Research on automated timetabling algorithm for make-up examination and final clear examination
Author :
OuYang, Yong ; Chen, Yi
Author_Institution :
Sch. of Comput. Sci., Hubei Univ. of Technol., Wuhan, China
Abstract :
Automated examination timetabling generally refers to timetabling for centralized examination. There are few literatures researching on automated timetabling for make-up examination and final clear examination, in fact, there are great differences between timetabling for make-up examination and final clear examination and that for centralized examination. The paper put forward an idea based on greedy method to realize automated timetabling for make-up examination and final clear examination, be compatible with manual timetabling results, allocate resource reasonably, and solve various hard and soft conditions to satisfy users. Carrying high efficiency and low cost, the algorithm can be applied extensively in colleges for timetabling for make-up examination and final clear examination.
Keywords :
educational administrative data processing; educational institutions; automated timetabling algorithm; centralized examination; college; final clear examination; make up examination; Algorithm design and analysis; Educational institutions; Manuals; Optimization; Resource management; Sorting; final clear examination; greedy method; make-up examination;
Conference_Titel :
Computer Science and Education (ICCSE), 2010 5th International Conference on
Conference_Location :
Hefei
Print_ISBN :
978-1-4244-6002-1
DOI :
10.1109/ICCSE.2010.5593548