Optimal Solution Strategy for University Course Timetabling Problem

Simple item page
dc.contributor.authorChacha, Stephen
dc.contributor.authorMushi, Allen
dc.date.accessioned2018-11-23T07:03:56Z
dc.date.available2018-11-23T07:03:56Z
dc.date.issued2013-01
dc.description.abstractThis 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.en_US
dc.identifier.issn0976-5697
dc.identifier.urihttp://hdl.handle.net/20.500.11810/5010
dc.language.isoenen_US
dc.publisherInternational Journal of Advanced Research in Computer Scienceen_US
dc.relation.ispartofseries;Volume 4, No. 2
dc.subjectTimetabling Problem, Combinatorial Optimization, NP-hard problem, reformulations, schedulingen_US
dc.titleOptimal Solution Strategy for University Course Timetabling Problemen_US
dc.typeJournal Articleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Optimal UCTP IJARC Mushi Chacha.pdf
Size:
289.64 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Department of Mathematics