Thian, Tze Yung (2015) Heuristic algorithm for university final examination timetabling. [Final Year Project Report] (Unpublished)
![[img]](http://ir.unimas.my/style/images/fileicons/text.png) |
PDF (Please get the password by email to repository@unimas.my , or call ext: 082-583914/3973/3933)
THIAN TZE YUNG (fulltext).pdf Restricted to Registered users only Download (124MB) |
Abstract
This thesis proposes a heuristic algorithm for solving faculty final examination timetabling problem. There are two parts fbr the algorithm which are course grouping and timeslot allocation. In the, first part, the grouping of courses is simplified using the lecture timetable which acts as a stepping stone, for solving constraints. Hence, proceed to the second part which allocates the course examinations into available timeslots and venue that fix the required capacity. The large class allocation will be executed first to prevent insufficient of venue with large capacity then followed by small class allocation.
| Item Type: | Final Year Project Report |
|---|---|
| Additional Information: | Project Report (B.Sc.) -- Universiti Malaysia Sarawak, 2015. |
| Uncontrolled Keywords: | Heuristic algorithm, Course grouping, Yimeslot allocation. |
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Academic Faculties, Institutes and Centres > Faculty of Computer Science and Information Technology Faculties, Institutes, Centres > Faculty of Computer Science and Information Technology Academic Faculties, Institutes and Centres > Faculty of Computer Science and Information Technology |
| Depositing User: | Unai |
| Date Deposited: | 07 Sep 2022 04:54 |
| Last Modified: | 15 Jan 2024 09:06 |
| URI: | http://ir.unimas.my/id/eprint/39572 |
Actions (For repository members only: login required)
 |
View Item |
