A multicriteria approach to examination timetabling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2079 LNCS, Issue , 2001, Pages 118-131

  Burke, Edmund ^a   Bykov, Yuri ^a   Petrovic, Sanja ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; HEURISTIC ALGORITHMS; PROBLEM SOLVING;

COMPROMISED SOLUTION; DISTANCE MEASURE; EXAM TIMETABLING; EXAMINATION TIMETABLING; HEURISTIC SEARCH; MULTI-CRITERIA APPROACH; MULTI-CRITERIA DECISION PROBLEMS; SECOND PHASE;

SCHEDULING;

EID: 84889608352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44629-x_8     Document Type: Conference Paper

References (24)

1. Arani, T., Lotfi, V.: A Three Phased Approach to Final Exam Scheduling. IIE Trans. 21 (1989) 86-96
2. Balakrishnan, N., Lucena, A., Wong, R.T.: Scheduling Examinations to Reduce Second-Order Conflicts. Comput. Oper. Res. 19 (1992) 353-361
3. Brailsford, S.C., Potts, C.N., Smith, B.M.: Constraint Satisfaction Problems: Algorithms and Applications. Eur. J. Oper. Res. 119 (1999) 557-581
4. Burke, E.K., Newall, J.P.: A Multi-stage Evolutionary Algorithm for the Timetable Problem, IEEE Trans. Evol. Comput. 3 (1999) 63-74
5. 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)
6. 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)
7. 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
8. 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
9. 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.
10. Carter, M.W, Laporte, G., Lee, S.Y.: 1996. Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 47 (1996) 373-383
11. Carter, M.W.: A Survey of Practical Applications of Examination Timetabling Algorithms, Oper. Res. 34 (1986) 193-202
12. 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
13. 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
14. 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
15. 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)
16. Lotfi, V., Cerveny, R.: A Final Exam-Scheduling Package. J. Oper. Res. Soc. 42 (1991) 205-216
17. 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
18. Petrovic, S., Petrovic, R.: Eco-Ecodispatch: DSS for Multicriteria Loading of Thermal Power Generators. J. Decis. Syst. 4 (1995) 279-295
19. Romero B.P.: 1982. Examination Scheduling in a Large Engineering School: A Computer- Assisted Participative Procedure. Interfaces 12 (1982) 17-23
20. 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
21. 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
22. 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
23. Zeleny, M., 1974. A Concept of Compromise Solutions and the Method of Displaced Ideal. Comput. Oper. Res. 1 479-496.
24. 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.