| dc.creator |
Mushi, Allen R. |
|
| dc.creator |
Chacha, S. |
|
| dc.date |
2016-03-16T15:04:58Z |
|
| dc.date |
2016-03-16T15:04:58Z |
|
| dc.date |
2013 |
|
| dc.date.accessioned |
2018-04-18T11:50:12Z |
|
| dc.date.available |
2018-04-18T11:50:12Z |
|
| dc.identifier |
Stephen, 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.identifier |
0976-5697 |
|
| dc.identifier |
http://hdl.handle.net/123456789/1029 |
|
| dc.identifier.uri |
http://hdl.handle.net/123456789/10635 |
|
| dc.description |
Full text available at http://search.proquest.com/openview/0a0d4bac06d8d4d612928ae1dc0cad4f/1.pdf?pq-origsite=gscholar&cbl=1606379 |
|
| dc.description |
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. |
|
| dc.language |
en |
|
| dc.publisher |
International Journal of Advanced Research in Computer Science |
|
| dc.subject |
Timetabling Problem |
|
| dc.subject |
Combinatorial Optimization |
|
| dc.subject |
NP-hard problem |
|
| dc.subject |
reformulations |
|
| dc.subject |
scheduling |
|
| dc.title |
Optimal Solution Strategy for University Course Timetabling Problem |
|
| dc.type |
Journal Article |
|