Educational timetabling problem is a challenging real world problem which has been of interest to many researchers and practitioners. There are many variants of this problem which mainly require scheduling of events and resources under various constraints. In this study, a curriculum based course timetabling problem at Yeditepe University is described and an iterative selection hyper-heuristic ...

Timetabling problems often consists from various requirements which can not be satisfied together [11]. Unsatisfiable requirements can be handled within optimization criteria as soft constraints. Such soft constraints may not be satisfied if there are some contradictions. The remaining hard constraints must be still satisfied. The set of hard and soft constraints can be naturally expressed usin...

The purpose of this research is to solve the university course timetabling problem (UCTP) that consists designing a schedule courses be offered in one academic period based on students’ demand, faculty composition and institutional constraints considering policies established standards Association Advance Collegiate Schools Business (AACSB) accreditation. These involve assignment with high leve...

Many successful approaches to examination timetabling consist of multiple stages, in which a constructive approach is used for finding a good initial solution, and then one or more improvement approaches are employed successively to further enhance the quality of the solution obtained during the previous stage. Moreover, there is a growing number of studies describing the success of approaches ...

Many successful approaches to examination timetabling consist of multiple stages, in which a constructive approach is used for finding a good initial solution, and then one or more improvement approaches are employed successively to further enhance the quality of the solution obtained during the previous stage. Moreover, there is a growing number of studies describing the success of approaches ...

This paper introduces a new timetabling problem on universities, called interview timetabling. In this problem, some constant number, say three, of referees are assigned to each of 2n graduate students. Our task is to construct a presentation timetable of these 2n students using n timeslots and two rooms, so that two students evaluated by the same referee must be assigned to different timeslots...

The annual construction of an Exam Timetable is a common problem for all institutions of higher education. Quite often it is done by hand or with the limited help of a simple administration system and usually involves taking the previous year’s timetable and modifying it so it will work for the new year. Many British institutions are now introducing the concept of the modular degree. This gives...

An extension of constraint logic programming that allows for weighted partial satisfaction of soft constraints is described and applied to the development of an automated timetabling system for Purdue University. The soft constraint solver implemented in the proposed solution approach allows constraint propagation for hard constraints together with preference propagation for soft constraints. A...

In the Department of Intelligence Science and Technology, Graduate School of Informatics, Kyoto University, there are approximately 20 professors, and 40 graduate course students in each year. In the final year of the course, every student submits a research thesis, and presents his/her work in twenty minutes to obtain a master degree. Presentation meeting is scheduled for two days, and in gene...