Genetic-Algorithm-Based Solution for University Course Timetabling Problem (UCTP) in the Department of Industrial Engineering, UAJY
University Course Timetabling Problem (UCTP) is a type of scheduling problem that exists in higher education institutions. All institutions have unique constraints and make UCTP one of the complex scheduling problems. The same condition also happens in the Department of Industrial Engineering, UAJY. Each semester a teaching schedule must be released and the arrangement is usually performed manually. This manual method needs a huge time and energy effort of the head of the department and the staff. The reason is that this process must consider various and complex constraints. There are two types of constraints, namely, hard constraints and soft constraints. Hard constraints consist of the need for a free-conflict schedule and soft constraints consist of the time preference of the lecturers.
According to the condition, we develop a Genetic Algorithm (GA)-based scheduling system to solve such the problem. The latest version (until 2021) of the system has the following capabilities:
a. A guaranteed free-conflict schedule.
b. Cope with the lecturers’ available time
Future works can be addressed to the following issues: UCTP for inter-department courses, lecturers’ time preferences, human factors in scheduling.
Researchers: Wisnu Prasojo, S.T. (160608873)
Bill Samuel Latumahina, S.T. (170609130)
Supervisor: Anugrah K. Pamosoaji, S.T., M.T., Ph.D.

(Prasojo, 2020)

(Latumahina, 2021)