Mathematical Programming Formulations for the Examinations Timetable Problem

Simple item page
dc.contributor.authorMushi, Allen
dc.date.accessioned2018-11-23T07:02:35Z
dc.date.available2018-11-23T07:02:35Z
dc.date.issued2004-12
dc.description.abstractExaminations Timetabling Problem (ETP) is the problem of assigning courses to be examined and candidates to time periods and examination rooms while satisfying a set of constraints. Every University has a different set of constraints and structure of examinations. Thus there is no general ETP model for all Universities around the world [1]. ETP is NP-Hard [2] and therefore no optimal algorithm is known for this problem which can solve a general problem within reasonable time. However, exact methods can be used to provide a benchmark for the heuristic methods. There is no general model for University Timetabling Problems because the problem feature differs from one University to another. In this paper we focus in the formulation of the ETP for the University of Dar as salaam. We formulate, test and compare three Integer Programming models. It is concluded that, although exact methods cannot give a solution to a real-size problem, these models give a good benchmark for testing the performance of other approaches. This paper also gives a direction for better exact models for the University of Dar es salaam’s ETP. INTRODUCTION The Examination-Timetabling Problem (ETP) essentially involves the assignment of courses to be examined and their candidates to time periods and examination rooms while satisfying a given set of constraints. These constraints are divided into hard and soft [i], [ii]. Hard constraints must be satisfied such as avoiding studentexamination collision and room over-sizing. Soft constraints mayen_US
dc.identifier.issn1607-9949
dc.identifier.urihttp://hdl.handle.net/20.500.11810/4999
dc.language.isoenen_US
dc.publisherAfrican Journal of Science and Technology (AJST)en_US
dc.relation.ispartofseriesScience and Engineering Series;Vol. 5, No. 2
dc.subjectMathematical Programming, Examinations Timetabling, Combinatorial Optimizationen_US
dc.titleMathematical Programming Formulations for the Examinations Timetable Problemen_US
dc.title.alternativeThe Case of the University of Dar Es Salaamen_US
dc.typeJournal Articleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
MIP Formulations for ETP AJST Published.pdf
Size:
49.75 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