University timetable
Encyclopedia
University timetables are quite different from school timetables
. The main difference is the fact that in high schools, students have to be occupied and supervised every hour of the school day, or nearly every hour. Also, high school teachers generally have much higher teaching loads than is the case in universities. As a result, it is generally considered that university timetables involve more human judgement whereas high school timetabling is a more computationally intensive task, see constraint satisfaction problem
.
In other words, university timetables have less constraints, i.e. room capacity is not considered, as students don't have to attend lectures.
Until examination period. Then, examination timetabling problem arises.
Examination timetabling problems can be categorized as either uncapacitated or capacitated. In the uncapacitated examination timetabling problem, room capacities are not considered, while in the capacitated problem the room capacities are treated as a hard constraint.
School timetable
A school timetable is a table for coordinating these four elements:*Students*Teachers*Rooms*Time slots Other factors include the subject of the class, and the type of classrooms available ....
. The main difference is the fact that in high schools, students have to be occupied and supervised every hour of the school day, or nearly every hour. Also, high school teachers generally have much higher teaching loads than is the case in universities. As a result, it is generally considered that university timetables involve more human judgement whereas high school timetabling is a more computationally intensive task, see constraint satisfaction problem
Constraint satisfaction problem
Constraint satisfaction problems s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over variables, which is solved by constraint...
.
In other words, university timetables have less constraints, i.e. room capacity is not considered, as students don't have to attend lectures.
Until examination period. Then, examination timetabling problem arises.
Examination timetabling problems can be categorized as either uncapacitated or capacitated. In the uncapacitated examination timetabling problem, room capacities are not considered, while in the capacitated problem the room capacities are treated as a hard constraint.
See also
- Time horizonTime horizonA time horizon, also known as a planning horizon, is a fixed point of time in the future at which point certain processes will be evaluated or assumed to end. It is necessary in an accounting, finance or risk management regime to assign such a fixed horizon time so that alternatives can be...
- TimelineTimelineA timeline is a way of displaying a list of events in chronological order, sometimes described as a project artifact . It is typically a graphic design showing a long bar labeled with dates alongside itself and events labeled on points where they would have happened.-Uses of timelines:Timelines...
- Time ManagementTime managementTime management is the act or process of exercising conscious control over the amount of time spent on specific activities, especially to increase efficiency or productivity. Time management may be aided by a range of skills, tools, and techniques used to manage time when accomplishing specific...
- Constraint Satisfaction ProblemConstraint satisfaction problemConstraint satisfaction problems s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over variables, which is solved by constraint...
External links
- Examination Timetabling Problem Description
- Google list of scheduling software
- PATAT Conferences The International Series of Conferences on the Practice and Theory of Automated Timetabling
- Another directory of software products
- International Timetabling Competition 2007
- The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution