Abstract
The exam scheduling problem has been classified as nondeterministic polynomial time-complete (NP-complete) problem because of the polynomial time algorithm to obtain the exact solution has been unknown yet. Guret et al. tries to obtain the solution using linear programming with time complexity for this problem. On the other hand, this paper suggests chromatic number algorithm with O(m) time complexity. The proposed algorithm converts the original data to incompatibility matrix for modules and graph firstly. Then, this algorithm packs the minimum degree vertex (module) and not adjacent vertex to this vertex into the bin with color in order to exam within minimum time period and meet the incompatibility constraints. As a result of experiments, this algorithm reduces the of linear programming to O(m) time complexity for exam scheduling problem, and gets the same solution with linear programming.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Korea Society of Computer and Information
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
