School scheduling using threshold accepting

Cybernetics and Systems

Volumn 29, Issue 6, 1998, Pages 593-611

  Abboud, Nicolas ^a   Sakawa, Masatoshi ^a   Inuiguchi, Masahiro ^b  

^a HIROSHIMA UNIVERSITY   (Japan)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING; SIMULATED ANNEALING;

REAL-WORLD HIGH SCHOOL TIMETABLE PROBLEMS; THRESHOLD ACCEPTING METHODS;

COMPUTER AIDED INSTRUCTION;

EID: 0032166877     PISSN: 01969722     EISSN: 10876553     Source Type: Journal    
DOI: 10.1080/019697298125533     Document Type: Article

References (9)

1. Aarts, E. and J. Korst. 1989. Simulated Annealing and Boltzmann Machine. New York: John Wiley & Sons.
2. Csima J. and C. Gotleib. 1961. Tests on a computer method for construction of school timetables. Comm. ACM 7: 160-163.
3. De Gans, O. 1981. A computer timetabling system for secondary schools in the Netherlands. European J. Oper. Res. 7: 175-182.
4. De Werra, D. 1971. Construction of school timetables by flow methods. Information Systems and Operational Research (INFOR) Canada 9: 12—22.
5. Dhar, V. and N. Ranganathan. 1990. Integer programming vs. expert systems: An experimental comparison. Comm. ACM 33: 323-336.
6. Dueck, G. and T. Scheuer. 1990. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. J. Com -put. Phys. 90: 161 —175.
7. Even, S., A. Itai, and A. Shamir. 1976. On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5: 691 -703.
8. Glover, F. and H. Greenberg. 1989. New approaches for heuristic search: A bilateral linkage with artificial intelligence. European J. Oper. Res. 39: 119 -130.
9. Lawrie, N. 1969. An integer programming model of a school timetabling problem. Comput. J. 12: 307-316.