university course timetabling is a complex optimizationproblem. there are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. eachcomponent enforces a set of normally conflicting constraints on thesolution space. the problem will be solved if courses are scheduled indifferent rooms and within some specific time slots such that a set of...

The “Academic Timetabling System” is a research project that has been funded by the deanship of scientific research of Tabuk University. The project aims at developing and implementing an academic time tabling system for Tabuk University that is based on MultiAgent technology. In this paper we introduce the “Academic Time Tabling System” that has been designed and implemented in Tabuk Universit...

An earlier Case-based Reasoning (CBR) approach developed by the authors for educational course timetabling problems employed structured cases to represent the complex relationships between courses. The retrieval searches for structurally similar cases in the case base. In this paper, the approach is further developed to solve a wider range of problems. We also attempt to retrieve those cases th...

The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...

University timetabling problem is a very common and seemingly simple, but yet very difficult problem to solve in practice. While solution definitely exists (evidenced by the fact that we do hold classes), an automated optimal schedule is very difficult to derive at present. There were successful attempts to address this problem using heuristics search methods. However, until now, university tim...

The school timetabling problem, although less complicated than its counterpart for the university, still provides a ground for interesting and innovative approaches that promise solutions of high quality. In this work, a Shift Assignment Problem is solved first and work shifts are assigned to teachers. In the sequel, the actual Timetabling Problem is solved while the optimal shift assignments t...

The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present t...