Optimal Solution Strategy for University Course Timetabling Problem
No Thumbnail Available
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
International Journal of Advanced Research in Computer Science
Abstract
Description
Full text available at http://search.proquest.com/openview/0a0d4bac06d8d4d612928ae1dc0cad4f/1.pdf?pq-origsite=gscholar&cbl=1606379
This paper describes formulations of the University Course Timetabling Problem as used at Mkwawa University College of Education. University Course Timetabling is the Problem of scheduling resources such as lectures, courses and rooms to a number of timeslots over a planning horizon, normally a week, while satisfying a number of problem-specific constraints. In this study, we have developed three models and tested using real data from the stated University. It has been possible to get optimal solution for real problem instances through reformulations of models which involve a mixture of binary and time-indexed variables.
This paper describes formulations of the University Course Timetabling Problem as used at Mkwawa University College of Education. University Course Timetabling is the Problem of scheduling resources such as lectures, courses and rooms to a number of timeslots over a planning horizon, normally a week, while satisfying a number of problem-specific constraints. In this study, we have developed three models and tested using real data from the stated University. It has been possible to get optimal solution for real problem instances through reformulations of models which involve a mixture of binary and time-indexed variables.
Keywords
Timetabling Problem, Combinatorial Optimization, NP-hard problem, reformulations, scheduling