A study on heuristic timetabling method for faculty course timetable problem

• Main Authors: Lih, Bong Chia, Nah, Sze San, Noor Alamshah, Bolhassan
• Format: E-Article
• Language: English
• Published: Institute of Electrical and Electronics Engineers Inc. 2015
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://ir.unimas.my/id/eprint/15198/1/A-study-on-heuristic-timetabling-method-for-faculty-course-timetable-problem_2015_2015-9th-International-Conference-on-IT-in-Asia-Transforming-Big-Data-into-Knowledge%2C-CITA-2015---Proceedings.html; http://ir.unimas.my/id/eprint/15198/; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962783038&doi=10.1109%2fCITA.2015.7349832&partnerID=40&md5=a63fc9549d7130e0c15a09fffe1bb22b

This paper studies university course timetabling problem in a case study related to faculty management system, which is concerned with assigning students/lecturers to classes and time-slots. In order to increase flexibility choices of timeslot for "repeaters", the problem has become more tight in scheduling. A two-stage heuristic approach is presented, where the initial stage groups the courses that are able to conduct simultaneously. The second stage then assigns the weekly timeslots for each group of courses, followed by venue for each course. Computational results are presented for the proposed solution using real data. It shows that the proposed solution is effective to handle the faculty course timetabling