School timetabling using heuristic search

Journal of the Operational Research Society

Volumn 47, Issue 3, 1996, Pages 347-357

  Wright, Mike ^a  

^a LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Education; Heuristics; Influential diversification; Schools; Tabu search; Timetabling

Indexed keywords

COMPUTER SYSTEMS; DECISION SUPPORT SYSTEMS; EDUCATION; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; SOCIETIES AND INSTITUTIONS; VALUE ENGINEERING;

HEURISTIC SEARCH; INFLUENTIAL DIVERSIFICATION; SCHOOL TIMETABLING; SCHOOLS; TABU SEARCH;

OPERATIONS RESEARCH;

EID: 0030109996     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.34     Document Type: Article

References (19)

1. D. de Werra (1985) An introduction to timetabling. Eur. J. Opl Res. 19, 151-162.
2. D. Abramson (1991) Constructing school timetables using simulated annealing: sequential and parallel algorithms. Mgmt Sci. 37, 98-113.
3. A. Hertz (1991) Tabu search for large-scale timetabling problems. Eur. J. Opl Res. 54, 39-47.
4. N. Galakrishnan, A. Lucena and R. T. Wong (1992) Scheduling examinations to reduce second-order conflicts. Comp, and Opns Res. 19, 353-361.
5. J. A. Ferland and A. Lavoie (1992) Exchange procedures for timetabling problems. Dis. Appl. Math. 35, 237-253.
6. P. Dige, C. Lund and H. F. Ravn (1993) Timetabling by simulated annealing. Lecture Notes in Economics and Mathematical Systems 396, 151-174.
7. D. Johnson (1993) A database approach to course timetabling. J. Opl Res. Soc. 44, 425-433.
8. J. A. Ferland and C. Fleurent (1994) SAPHIR: a decision support system for course scheduling. Interfaces 24(2), 105-115.
9. J. M. Thompson and K. A. Dowsland (1996) Variants of simulated annealing for the examination timetabling problem. To appear in Annals of Operations Research.
10. R. Moon (1991) A Guide to the National Curriculum. Oxford University Press, Oxford.
11. R. Simper (1980) A Practical Guide to Timetabling. Ward Lock Educational, London.
12. C. Morgenstern and H. Shapiro (1989) Chromatic number approximation using simulated annealing. Technical Report CS86-1, Department of Computer Science, University of New Mexico.
13. R. W. Eglese (1986) Heuristics in operational research. In Recent Developments in Operational Research (V. Belton and R. W. O’Keefe, Eds.), pp. 49-67, Pergamon Press, Oxford.
14. M. B. Wright (1994) Timetabling county cricket fixtures using a form of tabu search. J. Opl Res. Soc. 45, 758-770.
15. R. Hubscher and F. Glover (1994) Applying tabu search with influential diversification to multiprocessor scheduling. Comp, and Opns Res. 21, 877-884.
16. F. Glover (1990) Tabu search: a tutorial. Interfaces 20(4), 74-94.
17. R. C. Marett and M. B. Wright (1996) A comparison of neighbourhood search techniques for multi-objective combinatorial problems. To appear in Computers and Operations Research.
18. E. Taillard (1991) Robust tabu search for the quadratic assignment problem. Parallel Computing 17, 443-455.
19. M. Widmer (1991) Job shop scheduling with tooling constraints: a tabu search approach. J. Opl Res. Soc. 42, 75-82.