Title :
Research on Automatic Examination Arrangement Algorithms for Invigilator
Author :
OuYang, Yong ; Li, Hong
Author_Institution :
Sch. of Comput. Sci., Hubei Univ. of Technol., Wuhan, China
Abstract :
The current examination arrangement algorithm takes little attention to the examination arrangement for invigilator, the paper proposes a improved algorithm to achieve automatic examination arrangement for invigilator based on greedy method, the algorithm can support the priorities better, set maximum frequency of invigilating and satisfy other personalization examination arrangement requirements, and also it can configure resources reasonable and solve various software and hardware condition restrict to get the satisfactory solution. The practical application shows that the algorithm is highly efficient, low-cost, and can be widely used in various colleges and universities.
Keywords :
computational complexity; educational administrative data processing; greedy algorithms; automatic examination arrangement algorithms; greedy method; personalization examination arrangement; resource configuration; Algorithm design and analysis; Bismuth; Computer science; Data mining; Educational institutions; Software; Software algorithms; Examination Arrangement Algorithm; Invigilator; NP Difficult;
Conference_Titel :
Information Technology and Computer Science (ITCS), 2010 Second International Conference on
Conference_Location :
Kiev
Print_ISBN :
978-1-4244-7293-2
Electronic_ISBN :
978-1-4244-7294-9
DOI :
10.1109/ITCS.2010.134