In this article, we approach the ExaminationTimetabling Problem (ETP) from a student-centric point of view. We allow for multiple versions of an exam to be scheduled to increase the spreading of exams for students. We propose two Column Generation (CG) algorithms. In the first approach, a column is defined as an exam schedule for every unique student group, and two Pricing Problems (PPs) are de...

This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabling problem at the University Kebangsaan, Malaysia. We utilise a new objective function that was proposed in our previous work to evaluate the quality of the timetable. The objective function considers both timeslots a...

The examination timetabling problem has been studied in many different forms and using a variety of techniques over the years [1], [3], [4], [6]. In its simplest form, it is required that a set of exams are scheduled into a set of time periods in such a way that no two exams with students in common are scheduled at the same time. In practice there are a wide range of other constraints which mus...

This paper introduces the multiphase course timetabling problem and presents mathematical formulations effective solution algorithms to solve it in a real case study. Consider pool of lessons number students who are required take subset these graduate. Each lesson consists predetermined consecutive sequence phases with possibly different resource requirements duration. Students must be present ...

In this paper we present an application of Tabu Search (TS) to the exams timetabling problem. One of the drawback of this meta-heuristic is related with some parameter that can affect the performance of the algorithm and must be tuned. One of such is tabu tenure which is much problem dependent. Our goal is to have a automatic process of managing the memory which is important for practical appli...