Abstract
Scheduling and planning are considered difficult combinatorial optimisation problems and belong to the NP-complete class. The university course timetabling problem (UCTP) is one such type of problem which is to be solved under various constraints. The purpose of this paper is to create a university course timetable generator to automate the university course scheduling process, which is one of the most challenging and cumbersome tasks for the administration. All modules of the proposed timetable generator are inter-linked in SQL database and implemented in C# programming on the .NET platform. The proposed university course timetable generator is tested on several randomly generated problem instances of various complexities to verify the efficiency. The outcomes of them signify the importance of the solver, as it is producing a conflict-free timetable by taking very less amount of time and primary memory.
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: International Journal of Industrial and Systems Engineering
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.
