The authors of this paper were tasked to create an automated campus-wide timetabling system, for both course and examination timetable scheduling, for the National University of Singapore. This paper explains the development and design of the exam-scheduling portion of the University Timetable Scheduler (UTTS) software. The preliminary results of the application of the AC3 algorithm on this pro...

The university course timetabling problem deals with the assignment of lectures to specific timeslots and rooms. The goal is to satisfy the soft constraints to the largest degree possible while constructing a feasible schedule. In this paper, we present a hybrid approach consisting of three phases. During phase 1, initial solutions are generated using a constructive heuristic. An improvement ap...

Abstract This article presents a mixed-integer programming model for solving the university timetabling problem which considers allocation of students to classes and assignment rooms time periods each class. The was developed as part our participation in International Timetabling Competition 2019 produced ranking second place at competition. Modeling program is not new. Our contribution rests o...

University exam timetabling refers to scheduling exams into predefined days, time periods and rooms, given a set of constraints. Exam timetabling is a computationally intractable optimization problem, which requires heuristic techniques for producing adequate solutions within reasonable execution time. For large numbers of exams and students, sequential algorithms are likely to be time consumin...

Examination timetabling is a type of educational timetabling which is a highly challenging field for the researchers and practitioners. Examination timetabling problems require a search for the best assignment of examinations into a fixed number of time-slots possibly along with other resources, such as, a set of rooms with certain capacities, subject to a set of constraints. There are two comm...

The timetabling problem is well known to be NP complete combinatorial problem. The problem becomes even more complex when addressed to individual timetables of students. The core of dealing with the problem in this application is a timetable builder based on mixed direct-indirect encoding evolved by a genetic algorithm with a self-adaptation paradigm, where the parameters of the genetic algorit...

The main goal of this paper is to attempt an unbiased comparison of the performance of straightforward implementations of five different metaheuristics on a university course timetabling problem. In particular, the metaheuristics under consideration are Evolutionary Algorithms, Ant Colony Optimization, Iterated Local Search, Simulated Annealing, and Tabu Search. To attempt fairness, the impleme...

The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a significant increase in its complexity, imposing even more difficulties on university administrators who must find a solution, often without any computer aid. Of the many methods that have been applied to solving the p...