A study on course timetabling for FCSIT
This thesis proposes a heuristic method for solving faculty course timetabling problem. The algorithm can be divided into two stages. The first stage is course grouping, which aiming to reduce the problem size. The second stage is timeslot and venue allocation according to the groups generated from...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Year Project Report |
| Language: | English English |
| Published: |
Universiti Malaysia Sarawak, (UNIMAS)
2014
|
| Subjects: | |
| Online Access: | http://ir.unimas.my/id/eprint/39281/1/BONG%20CHIA%20LIH%20%2824%20pgs%29.pdf http://ir.unimas.my/id/eprint/39281/4/BONG%20CHIA%20LIH%20%28ft%29.pdf http://ir.unimas.my/id/eprint/39281/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This thesis proposes a heuristic method for solving faculty course timetabling problem. The algorithm can be divided into two stages. The first stage is course grouping, which aiming to reduce the problem size. The second stage is timeslot and
venue allocation according to the groups generated from first stage. The larger classes will be allocated first due to limited resources on large lecture hall. Timetable based
on real data from SEM 1 2011/2013 was generated by this automated algorithm. The computational result shows that the algorithm was fast in generating solution. There also no class clashes generated in this case study. Besides, most of the students' timetables were evenly distributed. |
|---|