scispace - formally typeset
Journal ArticleDOI

An integer programming formulation for a case study in university timetabling

TLDR
A novel 0–1 integer programming formulation of the university timetabling problem is presented and it is shown that this model is solvable by existing software tools with IP solvers, even for large departments.
About
This article is published in European Journal of Operational Research.The article was published on 2004-02-16. It has received 238 citations till now. The article focuses on the topics: Integer programming & Optimization problem.

read more

Citations
More filters
Journal ArticleDOI

Assignment problems : A golden anniversary survey

TL;DR: A limited survey of what appear to be the most useful of the variations of the assignment problem that have appeared in the literature over the past 50 years and what they are called so as to make it easier for a researcher trying to develop some variation of the assignments problem for a particular application to find the relevant literature.
Journal ArticleDOI

A survey of metaheuristic-based techniques for University Timetabling problems

TL;DR: An overview of metaheuristics in university timetabling applications is carried out, paying particular attention to the various methods that have been proposed for dealing and differentiating between constraints of varying importance.
Journal ArticleDOI

A survey of approaches for university course timetabling problem

TL;DR: The distributed multi agent systems based approach (Cooperative Search method) is investigated due to its scalability which enables the timetabling of common events between departments and in this work a complete introduction of reliable datasets has been given to test and evaluation of the structure of considered algorithms.
Journal ArticleDOI

Efficient solutions for a university timetabling problem through integer programming

TL;DR: A two-stage relaxation procedure that solves efficiently the integer programming formulation of a university timetabling problem and gives a chance for further improvements in the final timetables as well as for certain degree of interaction with the users during the construction of the timetables.
Journal ArticleDOI

Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results

TL;DR: A set of formulations for the Curriculum-Based Course Timetabling problem is proposed, with the aim of “capturing” many real-world formulations, and thus encouraging researchers to “reduce” their specific problems to one of them, gaining the opportunity to compare and assess their results.
References
More filters
Journal ArticleDOI

An introduction to timetabling

TL;DR: A huge variety of timetabling models have been described in the OR literature; they range from the weekly timetable of a school to the scheduling of courses or exams in a university.
Journal ArticleDOI

A Survey of Automated Timetabling

TL;DR: A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or school) and the types of constraints as mentioned in this paper.
Journal ArticleDOI

Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

TL;DR: This paper focuses on effective modeling, preprocessing, and the methodologies of branch-and-cut and branch- and-price, which are the techniques that make it possible to treat problems with either a very large number of constraints or a verylarge number of variables.
Journal ArticleDOI

A tabu search algorithm for computing an operational timetable

TL;DR: A general technique based on tabu search for finding an acceptable timetable is presented and the resulting computerized algorithm is used for constructing different real course schedules.
Related Papers (5)