A Multicriteria Approach to Examination Timetabling

The main aim of this paper is to consider university examination timetabling problems as multicriteria decision problems. A new multicriteria approach to solving such problems is presented. A number of criteria will be defined with respect to a number of exam timetabling constraints. The criteria considered in this research concern room capacities, the proximity of the exams for the students, the order and locations of events, etc. Of course, the criteria have different levels of importance in different situations and for different institutions. The approach that we adopt is divided into two phases. The goal of the first phase is to find high-quality timetables with respect to each criterion separately. In the second phase, trade-offs between criteria values are carried out in order to find a compromised solution with respect to all the criteria simultaneously. This approach involves considering an ideal point in the criteria space which optimises all criteria at once. It is, of course, generally the case that a solution that corresponds to such a point does not exist. The heuristic search of the criteria space starts from the timetables obtained in the first phase with the aim of finding a solution that is as close as possible to this ideal point with respect to a certain defined distance measure. The developed methodology is validated, tested and discussed using real world examination data from various universities.

[1]  Milan Zelany,et al.  A concept of compromise solutions and the method of the displaced ideal , 1974, Comput. Oper. Res..

[2]  Bernardo Prida Romero,et al.  Examination Scheduling in a Large Engineering School: A Computer-Assisted Participative Procedure , 1982 .

[3]  Michael W. Carter,et al.  OR Practice - A Survey of Practical Applications of Examination Timetabling Algorithms , 1986, Oper. Res..

[4]  V. Lotfi,et al.  A Three Phased Approach To Final Exam Scheduling , 1989 .

[5]  John Williamson,et al.  Off‐the‐peg or made‐to‐measure? , 1990 .

[6]  Vahid Lotfi,et al.  A Final-Exam-Scheduling Package , 1991 .

[7]  Nagraj Balakrishnan,et al.  Scheduling examinations to reduce second-order conflicts , 1992, Comput. Oper. Res..

[8]  Gilbert Laporte,et al.  Recent Developments in Practical Examination Timetabling , 1995, PATAT.

[9]  Edmund K. Burke,et al.  A Memetic Algorithm for University Exam Timetabling , 1995, PATAT.

[10]  Sanja Petrovic,et al.  ECO-ECODISPATCH: DSS for multicriteria loading of thermal power generators , 1995 .

[11]  Wilhelm Erben,et al.  A Genetic Algorithm Solving a Weekly Course-Timetabling Problem , 1995, PATAT.

[12]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[13]  Geoffrey C. Fox,et al.  A Comparison of Annealing Techniques for Academic Course Scheduling , 1997, PATAT.

[14]  Kathryn A. Dowsland,et al.  Off-the-Peg or Made-to-Measure? Timetabling and Scheduling with SA and TS , 1997, PATAT.

[15]  George M. White,et al.  Generating Complete University Timetables by Combining Tabu Search with Constraint Logic , 1997, PATAT.

[16]  Peter Ross,et al.  Some Observations about GA-Based Exam Timetabling , 1997, PATAT.

[17]  Improving a Lecture Timetabling System for University-Wide Use , 1997, PATAT.

[18]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.

[19]  Edmund Ph. D. Burke,et al.  Practice and theory of automated timetabling II : second International Conference, PATAT '97, Toronto, Canada, August 20-22, 1997 : selected papers , 1998 .

[20]  Chris N. Potts,et al.  Constraint satisfaction problems: Algorithms and applications , 1999, Eur. J. Oper. Res..

[21]  Edmund K. Burke,et al.  A multistage evolutionary algorithm for the timetable problem , 1999, IEEE Trans. Evol. Comput..

[22]  John S. White,et al.  Envisioning Machine Translation in the Information Future , 2002, Lecture Notes in Computer Science.

[23]  J. Care ‘Off the Peg’ or ‘Made to Measure’ , 2002 .