Abstract: Course timetabling problems occur every semester in a university which includes the allocation of resources (subjects, lecturers and students) to a number of fixed rooms and timeslots. The assignment is carried out in a way such that there are no conflicts within rooms, students and lecturers, as well as fulfilling a range of constraints. The constraints consist of rules and policies set up by the universities as well as lecturers’ and students’ preferences of courses to be allocated in specific timeslots. This paper specifically focuses on the preferences of the course timetabling problem in one of the public universities in Malaysia. The demands will be considered into our existing mathematical model to make it more generalized and can be used widely. We have distributed questionnaires to a number of lecturers and students of the university to investigate their demands and preferences for their desired course timetable. We classify the preferences thus converting them to construct one mathematical model that can produce such timetable.
Abstract: The Resource-Constrained Project Scheduling
Problem (RCPSP) is concerned with single-item or small batch
production where limited resources have to be allocated to dependent
activities over time. Over the past few decades, a lot of work has
been made with the use of optimal solution procedures for this basic
problem type and its extensions. Brucker and Knust[1] discuss, how
timetabling problems can be modeled as a RCPSP. Authors discuss
high school timetabling and university course timetabling problem as
an example. We have formulated two mathematical formulations of
course timetabling problem in a new way which are the prototype of
single-mode RCPSP. Our focus is to show, how course timetabling
problem can be transformed into RCPSP. We solve this
transformation model with genetic algorithm.