Optimal Solution Strategy for University Course Timetabling Problem

Simple item page
dc.creatorMushi, Allen R.
dc.creatorChacha, S.
dc.date2016-03-16T15:04:58Z
dc.date2016-03-16T15:04:58Z
dc.date2013
dc.date.accessioned2018-03-27T08:57:46Z
dc.date.available2018-03-27T08:57:46Z
dc.descriptionFull text available at http://search.proquest.com/openview/0a0d4bac06d8d4d612928ae1dc0cad4f/1.pdf?pq-origsite=gscholar&cbl=1606379
dc.descriptionThis 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.
dc.identifierStephen, C. and Mushi, A.R., 2013. Optimal Solution Strategy for University Course Timetabling Problem. International Journal of Advanced Research in Computer Science, 4(1).
dc.identifier0976-5697
dc.identifierhttp://hdl.handle.net/123456789/1029
dc.identifier.urihttp://hdl.handle.net/123456789/4117
dc.languageen
dc.publisherInternational Journal of Advanced Research in Computer Science
dc.subjectTimetabling Problem
dc.subjectCombinatorial Optimization
dc.subjectNP-hard problem
dc.subjectreformulations
dc.subjectscheduling
dc.titleOptimal Solution Strategy for University Course Timetabling Problem
dc.typeJournal Article

Files

Collections

Department of Mathematics