An integer programming formulation for a case study in university timetabling

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 preferences regarding teaching periods or days of the week or even classrooms for specified courses. Moreover, with suitable definition of the cost coefficients in the objective function it is possible to reduce the solution space and make the problem tractable. The model is solvable by existing software tools with IP solvers, even for large departments. The case of a five-year Engineering Department with a large number of courses and teachers is presented along with its solution as resulted from the presented IP formulation. � 2003 Elsevier B.V. All rights reserved.

[1]  Efthymios Housos,et al.  Timetabling for Greek high schools , 1997 .

[2]  Alain Hertz,et al.  Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..

[3]  Margarida Vaz Pato,et al.  A Multiobjective Genetic Algorithm for the Class/Teacher Timetabling Problem , 2000, PATAT.

[4]  A. Tripathy School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[5]  Edmund K. Burke,et al.  A Genetic Algorithm Based University Timetabling System , 1994 .

[6]  Michel Truchon,et al.  Allocation of Classrooms by Linear Programming , 1986 .

[7]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[8]  Victor A. Bardadym Computer-Aided School and University Timetabling: The New Wave , 1995, PATAT.

[9]  George M. White,et al.  A logic approach to the resolution of constraints in timetabling , 1992 .

[10]  Charles E. Wells,et al.  A MATHEMATICAL PROGRAMMING MODEL FOR FACULTY COURSE ASSIGNMENTS , 1984 .

[11]  Panagiotis Miliotis,et al.  Implementation of a university course and examination timetabling system , 2001, Eur. J. Oper. Res..

[12]  Jon A. Breslaw A Linear Programming Solution to the Faculty Assignment Problem. , 1976 .

[13]  Arabinda Tripathy Computerised decision aid for timetabling - a case analysis , 1992, Discret. Appl. Math..

[14]  Edmund K. Burke,et al.  A Genetic Algorithm for University Timetabling , 1994 .

[15]  Safaai Deris,et al.  University timetabling by constraint-based reasoning: A case study , 1997 .

[16]  D. de Werra,et al.  The combinatorics of timetabling , 1997 .

[17]  Andreas Drexl,et al.  Distribution requirements and compactness constraints in school timetabling , 1997 .

[18]  Ben Paechter,et al.  Two solutions to the general timetable problem using evolutionary methods , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[19]  Martin W. P. Savelsbergh,et al.  Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition , 2000, INFORMS J. Comput..

[20]  Munirpallam A. Venkataramanan,et al.  OR Practice - An Efficient Decision Support System for Academic Course Scheduling , 1989, Oper. Res..

[21]  R. J. Willemen,et al.  Some Complexity Aspects of Secondary School TimeTabling , 2000 .

[22]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[23]  Jacques A. Ferland,et al.  A large scale timetabling problem , 1989, Comput. Oper. Res..

[24]  E. A. Akkoyunlu A Linear Algorithm for Computing the Optimum University Timetable , 1973, Comput. J..

[25]  Ben Paechter Optimising a Presentation Timetable Using Evolutionary Algorithms , 1994, Evolutionary Computing, AISB Workshop.

[26]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[27]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[28]  Jacques A. Ferland,et al.  Timetabling problem for university as assignment of activities to resources , 1985, Comput. Oper. Res..

[29]  Gilbert Laporte,et al.  Combinatorial Optimization Problems with Soft and Hard Requirements , 1987 .

[30]  Domingos M. Cardoso,et al.  The teacher assignment problem: A special case of the fixed charge transportation problem , 1997 .

[31]  Gunther Schmidt,et al.  Timetable Construction - An Annotated Bibliography , 1980, Comput. J..

[32]  Norman L. Lawrie An integer linear programming model of a school timetabling problem , 1969, Comput. J..

[33]  Huub M. M. ten Eikelder,et al.  Some Complexity Aspects of Secondary School Timetabling Problems , 2000, PATAT.

[34]  Donna F. Davis,et al.  A multi-objective course scheduling model: Combining faculty preferences for courses and times , 1998, Comput. Oper. Res..