Research on Coloring Theory and Greedy Method Based Automated Examination Arrangement Algorithm

Aiming at existing examination arrangement algorithm lacks of application value due to its too ideal conditions, this paper presents a improved algorithm based on coloring theory and greedy method, which realize automated examination arrangement by allocating resources such as examination time and classrooms by stages. The algorithm can solve kinds of forced/feasible constraints and satisfies users.