Constructing good solutions for the spanish school timetabling problem

Journal of the Operational Research Society

Volumn 47, Issue 10, 1996, Pages 1203-1215

  Alvarez Valdes, R ^a   Martin, G ^a   Tamarit, J M ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Heuristics; Scheduling; Timetabling

Indexed keywords

CALCULATIONS; COMPUTER SOFTWARE; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC PROGRAMMING; OPERATIONS RESEARCH; PARALLEL ALGORITHMS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING; TEACHING;

PARALLEL HEURISTIC ALGORITHM; RESOURCE CONSTRAINT; RESOURCE GRAPH; SPANISH SCHOOL TIMETABLING PROBLEM;

OPTIMIZATION;

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

References (23)

1. W. Junginger (1986) Timetabling in Germany—a survey. Interfaces 16(4), 66-74.
2. N. Chahal and D. de Werra (1989) An interactive system for constructing timetables on a PC. Eur. J. Opl Res. 40, 32-37.
3. D. Costa (1994) A tabu search algorithm for computing an operational timetable. Eur. J. Opl Res. 76, 98-110.
4. R. Osterman and D. de Werra (1982) Some experiments with a timetabling system. OR Spektrum 3,199-204.
5. O. B. dE Gans (1981) A computer timetabling system for secondary schools in the Netherlands. Eur. J. Opl Res. 7, 175-182.
6. R. J. Aust (1976) An improvement algorithm for school timetabling. Comput. J. 19, 339-343.
7. N. L. Lawrie (1969) An integer linear programming model of a school timetabling problem. Comput. J. 12, 307-316.
8. D. B. Papoullas (1980) The assignment-to-days problem in a school timetable: a heuristic approach. Eur. J. Opl Res. 4, 31-41.
9. D. Abramson (1991) Constructing school timetables using simulated annealing: sequential and parallel algorithms. Mgmt Sci. 37, 98—113.
10. F. Kitagawa and H. Ikeda (1988) An existential problem of weight-controlled subset and its application to school timetable construction. Discrete Maths, 72,195-211.
11. P. Dige, C. Lund and H. C. Raun (1993) Timetabling by simulated annealing: applied simulated annealing. Lecture Notes in Economics and Mathematical Sciences 396, 151-174.
12. R. Alvarez-Valdes and J. M. Tamarit (1989) Heuristic algorithms for resource constrained project scheduling: a review and an empirical analysis. In Advances in Project Scheduling (R. Slowinski and J. Weglarz, Eds.) pp 113-134. Elsevier, Amsterdam.
13. C. Bron and J. Kerbosh (1973) Algorithm 457—Finding all cliques of an undirected graph. Comm, of ACM 16, 575-577.
14. N. Christofides (1975) Graph Theory: an algorithmic approach. Academic Press, London.
15. F. Glover (1989) Tabu search: Part I. ORSA. J. Computing 1,190-206.
16. F. Glover (1990) Tabu search: Part II. ORSA J. Computing 2,4-32.
17. F. Glover, E. Taillard and D. de Werra (1993) A user’s guide to tabu search: Ann. of Opns Res. 41, 3-28.
18. A. Hertz (1991) Tabu search for large timetabling problems. Eur. J. Opl Res. 54, 39-47.
19. A. Hertz (1992) Finding a feasible course scheduling using tabu search. Discr. App. Maths 35, 255-270.
20. F. Glover and M. Laguna (1993) Tabu search. In Modern Heuristic Techniques for Combinatorial Problems. (C. R. Reeves Ed.), pp 70-150. Blackwell, Oxford.
21. E. Taillard (1991) Robust taboo search for the quadratic assignment problem. Parallel Computing 17,433-445.
22. R. W. Floyd (1962) Algorithm 97: Shortest path. Comm. A.C.M. 5, 345.
23. R. K. Ahuja, T. L. Magnanti and J. B. Orlin (1993) Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, N.J.