Heuristic algorithm for university final examination timetabling

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 steppin...

Full description

Saved in:
Bibliographic Details
Main Author: Thian, Tze Yung
Format: Final Year Project Report
Language:English
Published: Universiti Malaysia Sarawak, (UNIMAS) 2015
Subjects:
Online Access:http://ir.unimas.my/id/eprint/39572/3/THIAN%20TZE%20YUNG%20%28fulltext%29.pdf
http://ir.unimas.my/id/eprint/39572/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.unimas.ir.39572
record_format eprints
spelling my.unimas.ir.395722024-01-15T09:06:16Z http://ir.unimas.my/id/eprint/39572/ Heuristic algorithm for university final examination timetabling Thian, Tze Yung T Technology (General) 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. Universiti Malaysia Sarawak, (UNIMAS) 2015 Final Year Project Report NonPeerReviewed text en http://ir.unimas.my/id/eprint/39572/3/THIAN%20TZE%20YUNG%20%28fulltext%29.pdf Thian, Tze Yung (2015) Heuristic algorithm for university final examination timetabling. [Final Year Project Report] (Unpublished)
institution Universiti Malaysia Sarawak
building Centre for Academic Information Services (CAIS)
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Sarawak
content_source UNIMAS Institutional Repository
url_provider http://ir.unimas.my/
language English
topic T Technology (General)
spellingShingle T Technology (General)
Thian, Tze Yung
Heuristic algorithm for university final examination timetabling
description 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.
format Final Year Project Report
author Thian, Tze Yung
author_facet Thian, Tze Yung
author_sort Thian, Tze Yung
title Heuristic algorithm for university final examination timetabling
title_short Heuristic algorithm for university final examination timetabling
title_full Heuristic algorithm for university final examination timetabling
title_fullStr Heuristic algorithm for university final examination timetabling
title_full_unstemmed Heuristic algorithm for university final examination timetabling
title_sort heuristic algorithm for university final examination timetabling
publisher Universiti Malaysia Sarawak, (UNIMAS)
publishDate 2015
url http://ir.unimas.my/id/eprint/39572/3/THIAN%20TZE%20YUNG%20%28fulltext%29.pdf
http://ir.unimas.my/id/eprint/39572/
_version_ 1789430340147740672
score 13.160551