Examination timetabling

dc.contributor.author	Parkinson, E
dc.contributor.author	Warren, PR
dc.contributor.editor	Ram, Vevek
dc.date.accessioned	2018-08-15T12:31:07Z
dc.date.available	2018-08-15T12:31:07Z
dc.date.issued	1996
dc.identifier.citation	Parkinson, E. & Warren, P.R. (1996) Examination timetabling. Industry Meets Academia: Proceedings of the 1996 National Research and Development Conference, The South African Institute of Computer Scientists and Information Technologists, Interaction Conference Centre, University of Natal, Durban, 26 & 27 September, hosted by The Department of Computer Science and Information Systems, University of Natal, Pietermaritzburg, edited by Vevek Ram, (ISBN 0-620-20568-7).	en
dc.identifier.isbn	0-620-20568-7
dc.identifier.uri	http://hdl.handle.net/10500/24641
dc.description.abstract	We investigate the performance of simulated annealing and tabu search, two new general problem solving heuristics, on an examination timetabling problem. These two techniques are described here and issues arising from applying them to examination timetabling are discussed. The problem we use as a test case is one that appears in Fang (1992) in which genetic algorithms were used to produce approximate solutions and experimental results were presented showing the performance of genetic algorithms on this problem. Finally, we compare tabu search, simulated annealing and genetic algorithms on the basis of experimental results and draw some conclusions.	en
dc.language.iso	en	en
dc.title	Examination timetabling	en