An examination scheduling model to maximize students’ study time

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

Volumn 1408, Issue , 1998, Pages 78-91

  Bullnheimer, Bernd ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COST FUNCTIONS; SIMULATED ANNEALING; STUDENTS;

QUADRATIC ASSIGNMENT PROBLEMS; QUADRATIC SEMI-ASSIGNMENT PROBLEM; REAL WORLD SITUATIONS; SCHEDULING MODELS; SMALL SCALE;

SCHEDULING;

EID: 84957032835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055882     Document Type: Conference Paper

References (24)

1. Arani, T., M. Karwan and V. Lofti (1988): A Langrangian relaxation approach to solve the second phase of the exam scheduling problem, European Journal of Operational Research 34, 372-383.
2. Arani, T. and V. Lofti (1989): A Three Phased Approach to Final Exam Scheduling, IIE Transactions 21, 86-96.
3. Balakrishnan, N., A. Lucena and R.T. Wong (1992): Scheduling examinations to reduce second-order conflicts, Computers and Operations Research 19, 353-361.
4. Boufflet, J.P. and S. Negre (1996): Three Methods Used to Solve an Examination Timetable Problem, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetabling, Springer, Berlin, 327-344.
5. Burke, E.K., J.P. Newall and R.F. Weare (1996): A Memetic Algorithm for University Exam Timetabling, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetabling, Springer, Berlin, 241-250.
6. Carter, M.W. (1986): A survey of practical applications of examination timetabling algorithms, Operations Research 34, 193-202.
7. Carter~ M.W. and G. Laporte (1996): Recent Developments in Practical Examination Timetabling, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetabling, Springer, Berlin, 3-21.
8. Carter, M.W, G. Laporte and J.W. Chinneek (1994): A General Examination Scheduling System, Interfaces 24, 109-120.
9. Desroches, S., G. Laporte and J.-M. Rousseau (1978): HOREX: a computer program for the construction of examination schedules, INFOR 16, 294-298.
10. Dorigo, M., Maniezzo, V. and A. Colorni (1996): Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics 26 (1), 29-41.
11. Eglese, R.W. and G.K. Rand (1987): Conference Seminar Timetabfing, Journal of the Operational Research Society 38 (7), 591-598.
12. Ergfil~ A. (1995): GA-Based Examination Scheduling Experience at Middle East Technical University, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetabling, Springer, Berlin, 212-226.
13. Garey, M.R. and D.S. Johnson (1979): Computers and Intractability:A Guide to the Theory of NP-Completeness, W.H.Freeman, New York.
14. Hansen, M.P., V. Lauersen and R.V.V. Vidal (1995): Nationwide Scheduling of Examinations: Lessons from Experience, paper presented at: First International Conference on the Practice and Theory of Automated Timetabling, Edinburgh, 30th Aug. - 1st Sept. 1995.
15. Johnson, D. (1990): Timetabling university examinations, Journal of the Operational Research Society 41, 39-47.
16. Karp, R.M. (1972): Reducibility among Combinatorial Problems, in: Miller, R.E. and J.W. Thatcher (eds.): Complexity of Computer Computations, Plenum Press, New York, 85-103.
17. Kirkpatrick, S., C.D. Gelatt and M.P. Vecch| (1983): Optimization by Simulated Annealing, Science 220, 671-680.
18. Laarhoven, P.J.M. van and E.H.L. Aarts (1988): Simulated Annealing: Theory and Applications, Kluwer, Dordrecht.
19. Laporte, G. and S. Desroches (1984): Examination Timetabling by Computer, Computers and Operations Research 11 (4), 351-360.
20. Leong, T.Y. and W.Y. Yeong (1987): Examination Scheduling: A Quadratic Assignment Perspective, Proc. Int. Conf. on Optimization: Techniques and Applications, Singapore, April 1987, 550-558.
21. Mehta, N.K. (1981): The application of a graph coloring method to an examination scheduling problem, Interfaces 11, 57-64.
22. Thompson, J. and K.A. Dowsland (1996): General Cooling Schedules for a Simulated Annealing Based Timetabling System, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetablzng, Springer, Berlin, 345-363.
23. Welsh, D.J.A. and M.B. Powell (1967): An upper bound for the chromatic number of a graph and its application to timetabling problems, Computer Journal 10, 85-86.
24. White, G.M. and P.W. Chan (1979): Towards the construction of optimal examination schedules, INFOR 17, 219-229.