A survey of practical applications of examination timetabling algorithms
Operations Research
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
An introduction to formal specification and Z
An introduction to formal specification and Z
Construction of university faculty timetables using logic programming techniques
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Finding a feasible course schedule using Tabu search
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
The Complexity of Timetable Construction Problems
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Scheduling, Timetabling and Rostering - A Special Relationship?
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Building University Timetables Using Constraint Logic Programming
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Examination Timetabling in British Universities: A Survey
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
A Standard Data Format for Timetabling Instances
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Fast Practical Evolutionary Timetabling
Selected Papers from AISB Workshop on Evolutionary Computing
A survey of automated timetabling
A survey of automated timetabling
Scatter search technique for exam timetabling
Applied Intelligence
Semantic components for timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
An open interactive timetabling tool
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
| Hi-index | 0.00 |
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a number of different versions of the timetabling problem. These include school timetabling (where students are grouped in classes with similar degree plans), university timetabling (where students are considered individually) and examination timetabling (i.e. scheduling of university exams, avoiding student double booking). Several other problems are also associated with the more general timetabling problem, including room allocation, meeting scheduling, staff allocation and invigilator assignment. Many data formats have been developed for representing different timetabling problems. The variety of data formats currently in use, and the diversity of existing timetabling problems, makes the comparison of research results and exchange of data concerning real problems extremely difficult. In this paper we identify eight timetabling sub-problems and, based on that identification, we present a new language (UniLang) for representing timetabling problems. UniLang intends to be a standard suitable as input language for any timetabling system. It enables a clear and natural representation of data, constraints, quality measures and solutions for different timetabling (as well as related) problems, such as school timetabling, university timetabling and examination scheduling.