Each October, the Executive Education Unit at the Universidad de Chile develops its course schedules for the following year. By 2008, the complexities of increasing enrollments and course offerings had rendered its manual timetabling process unmanageable. Inconvenient and inflexible scheduling decisions were causing discontent among instructors and students, making the need for a more efficient...

As an academic in the School of Computer Science at Queen’s University, a visiting researcher to the Automated Scheduling, Opimisation and Planning (ASAP) group within the School of Computer Science and IT at the University of Nottingham and Managing Director of eventMAP Limited, a university technological spin out company, the author is in a unique position to provide comments on both the prac...

Course timetabling is a typical problem that all universities around the world have to face every semester. There exist a number of variants of this problem, depending on the specific requirements of the institution involved [13]. Thanks also to the international timetabling competition ITC-2007 [11], two formulations have, to some extent, lifted up to the status of “standard”. These are the so...

A novel 0–1 integer programming formulation of the university timetabling problem is presented. The model provides constraints for a great number of operational rules and requirements found in most academic institutions. Treated as an optimization problem, the objective is to minimize a linear cost function. With this objective, it is possible to consider the satisfaction of expressed preferenc...

This paper reports the design and implementation of a PC-based computer system to aid the construction of a combined university course±examination timetable. The speci®c diculties to be faced are the restricted availability of classrooms and the increased ̄exibility of the studentsÕ choices of courses, which makes the problem very tight. The system uses an integer programming (IP) model that a...

The aim of this paper is to give a brief introduction to some recent approaches to timetabling problems that have been developed or are under development in the Automated Scheduling, Optimisation and Planning Research Group (ASAP) at the University of Nottingham. We have concentrated upon university timetabling but we believe that some of the methodologies that are described can be used for dif...

Timetabling is a difficult (NP-complete) problem and belongs to a general class of problems known as scheduling. Due to a variety of constraints typical in different timetabling environments, it has been difficult to develop a generic solution for timetabling. This paper is an attempt to define a generic computational model for examination timetabling for predefined constraints found in the pro...

University course timetabling is an NP-Complete problem type which becomes even more difficult due to the specific requirements of each university. In this study, it was aimed solve a university by using integer programming and develop assignment models that can be easily adapted similar problems. The we developed for solution are based on model Daskalaki et al. [1]. addition, were taking into ...

University timetable scheduling, which is a typical problem that all universities around the world have to face every semester, an NP-hard problem. It task of allocating right timeslots and classrooms for various courses by taking into account predefined constraints. In current literature, many approaches been proposed find feasible timetables. Among others, swarm-based algorithms are promising...