Abstract
The university course timetabling problem is an NP-complete problem that deals with many factors such as lessons, classes, teachers, students, space and timeslots. It is an optimized problem requiring the allocation of resources so as to satisfy a specified set of constraints. The optimality was able to find feasible solutions in all instances of the dataset and close to optimal solutions in some instances. This study may be used as a benchmark for optimality that solve the curriculum based university course timetabling problem.
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: DEStech Transactions on Social Science, Education and Human Science
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.
