Variants of simulated annealing for the examination timetabling problem

Annals of Operations Research

Volumn 63, Issue , 1996, Pages 105-128

  Thompson, Jonathan M ^a   Dowsland, Kathryn A ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Graph theory; Multi objective optimisation; Simulated annealing; Timetabling

Indexed keywords

EID: 21344442632     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/BF02601641     Document Type: Article

References (20)

1. S. Broder, Final examination scheduling, Commun. ACM 7(1964)494-498.
2. V. Lotfi and R. Cerveny, A final-exam-scheduling package, J. Oper. Res. Soc. 42(1991)205-216.
3. T. Arani, M. Karwan and V. Lotfi, A Lagrangian relaxation approach to solve the second phase of the exam scheduling problem, Euro. J. Oper. Res. 34(1988)372-383.
4. N. Balakrishnan, A. Lucena and R.T. Wong, Scheduling examinations to reduce second-order conflicts, Comp. Oper. Res. 19(1992)353-361.
5. D. Johnson, Timetabling university examinations, J. Oper. Res. Soc. 41(1990)39-47.
6. H.A. Eiselt and G. Laporte, Combinatorial optimization problems with soft and hard requirements, J. Oper. Res. Soc. 38(1987)785-795.
7. A. Hertz, Tabu search for large scale timetabling problems, Euro. J. Oper. Res. 54(1991)39-47.
8. M.W. Carter, A survey of practical applications of examination timetabling by computer, Comp. Oper. Res. 34(1986)193-202.
9. N. Balakrishnan, Examination scheduling: A computerized application, OMEGA 19(1991)37-41.
10. M. Chams, A. Hertz and D. de Werra, Some experiments with simulated annealing for coloring graphs, Euro. J. Oper. Res. 32(1987)260-266.
11. N. Dubois and D. de Werra, EPCOT - an efficient procedure for coloring optimally with tabu search, Comp. Math. Appl. 25(1993)35-45.
12. K.A. Dowsland, Simulated annealing, in: Modern Heuristic Techniques for Combinatorial Problems, ed. C. Reeves (Blackwell Scientific, 1993).
13. D. Abramson, Constructing school timetables using simulated annealing: Sequential and parallel algorithms, Manag. Sci. 37(1991)98-113.
14. D. Abramson and H. Dang, School timetables: A case study using simulated annealing, in: Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, vol. 396 (Springer 1993) pp. 104-124.
15. P. Dige, C. Lund and H.F. Ravn, Timetabling by simulated annealing, in: Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, vol. 396 (Springer, 1993) pp. 151-174.
16. M.B. Wright, Scheduling English cricket umpires, J. Oper. Res. Soc. 42(1991)447-452
17. F. Glover, Tabu search - Part I, ORSA J. Comp. 1(1989)190-206.
18. C. Morgernstern and H. Shapiro, Chromatic number approximation using simulated annealing, Technical Report CS86-1, Department of Computer Science, University of New Mexico (1989).
19. S.R. White, Concepts of scale in simulated annealing, Proc. IEEE Int. Conf. on Computer Design (1984) pp. 646-651.
20. J.M. Thompson and K.A. Dowsland, Multi-objective university examination scheduling, Working Paper No. EBMS/1993/12, EBMS, Swansea University (1993).