Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arani, T., Lotfi, V.: A Three Phased Approach to Final Exam Scheduling. IIE Trans. 21 (1989) 86–96
Balakrishnan, N., Lucena, A., Wong, R.T.: Scheduling Examinations to Reduce Second-Order Conflicts. Comput. Oper. Res. 19 (1992) 353–361
Brailsford, S.C., Potts, C.N., Smith, B.M.: Constraint Satisfaction Problems: Algorithms and Applications. Eur. J. Oper. Res. 119 (1999) 557–581
Burke, E.K., Newall, J.P.: A Multi-stage Evolutionary Algorithm for the Timetable Problem, IEEE Trans. Evol. Comput. 3 (1999) 63–74
Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II: Selected Papers (PATAT’ 97, University of Toronto). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998)
Burke, E., Ross, P. (eds.): The Practice and Theory of Automated Timetabling: Selected Papers (PATAT’95, Napier University). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996)
Burke, E.K., Newall, J.P., Weare, R.F., 1996b. A Memetic Algorithm for University Exam Timetabling. In: Burke, E., Ross, P. (eds.): The Practice and Theory of Automated Timetabling: Selected Papers (PATAT’95, Napier University). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 241–250
Carter M.W., and Laporte G., 1998. Recent Developments in Practical Course Timetabling. In: Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II: Selected Papers (PATAT’97, University of Toronto). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 3–19
Carter, M.W, Laporte, G., 1996. Recent Developments in Practical Examination Timetabling. In: Burke, E., Ross, P. (eds.): The Practice and Theory of Automated Timetabling: Selected Papers (PATAT’95, Napier University). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 3–21.
Carter, M.W, Laporte, G., Lee, S.Y.: 1996. Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 47 (1996) 373–383
Carter, M.W.: A Survey of Practical Applications of Examination Timetabling Algorithms, Oper. Res. 34 (1986) 193–202
Dowsland, K.A.: Off the Peg or Made to Measure. In: Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II: Selected Papers (PATAT’ 97, University of Toronto). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 37–52
Elmohamed, S., Coddington, P., Fox., F.A.: Comparison of Annealing Techniques for Academic Course Scheduling. In: Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II: Selected Papers (PATAT’97, University of Toronto). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 92–112
Erben, W., Keppler, J.: 1996. A Genetic Algorithm Solving a Weekly Course-Timetabling Problem. In: Burke, E., Ross, P. (eds.): The Practice and Theory of Automated Timetabling: Selected Papers (PATAT’95, Napier University). Lecture Notes in Computer Science, Vol. 1153, Springer-Verlag, Berlin Heidelberg New York (1996) 198–211
Fisher, J.G., Shier, D.R.: A Heuristic Procedure for Large-Scale Examination Scheduling Problems. Technical Report 417. Department of Mathematical Sciences, Clemson University (1983)
Lotfi, V., Cerveny, R.: A Final Exam-Scheduling Package. J. Oper. Res. Soc. 42 (1991) 205–216
Paechter, B., Rankin, R.C., Cumming, A.: Improving a Lecture Timetabling System for University-Wide Use. In: Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II: Selected Papers (PATAT’97, University of Toronto). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 156–165
Petrovic, S., Petrovic, R.: Eco-Ecodispatch: DSS for Multicriteria Loading of Thermal Power Generators. J. Decis. Syst. 4 (1995) 279–295
Romero B.P.: 1982. Examination Scheduling in a Large Engineering School: A Computer-Assisted Participative Procedure. Interfaces 12 (1982) 17–23
Ross, P., Hart, E., Corne, D.: Some Observations about GA based Timetabling. In: Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II: Selected Papers (PATAT’ 97, University of Toronto). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 115–129
White, G.M., 2000. Constrained Satisfaction, Not So Constrained Satisfaction and the Timetabling Problem. A Plenary Talk. In: Burke, E., Erben, W. (eds.): Proc. 3rd Int. Conf. on the Practice and Theory of Automated Timetabling (University of Applied Sciences, Konstanz, August 16-18). Lecture Notes in Computer Science. Springer-Verlag, Berlin Heidelberg New York (2000) 32–47
White, G.M., Zhang, J. 1998. Generating Complete University Timetables by Combining Tabu Search with Constraint Logic. In: Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II: Selected Papers (PATAT’97, University of Toronto). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 187–210
Zeleny, M., 1974. A Concept of Compromise Solutions and the Method of Displaced Ideal. Comput. Oper. Res. 1 479–496.
Zeleny, M., 1973. Compromise programming. In: J.L. Cochrane and M. Zeleny (eds.): Multiple Criteria Decision Making, University of South Carolina Press, Columbia, 262–301.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burke, E., Bykov, Y., Petrovic, S. (2001). A Multicriteria Approach to Examination Timetabling. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-44629-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42421-5
Online ISBN: 978-3-540-44629-3
eBook Packages: Springer Book Archive