Improving a heuristic repair method for large-scale school timetabling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1713, Issue , 1999, Pages 275-288

  Kaneko, Kazuya ^a   Yoshikawa, Masazumi ^a   Nakakuki, Yoichiro ^a  

^a NEC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; REPAIR; SCHEDULING;

CONSTRAINT VIOLATION; HEURISTIC REPAIR METHODS; INITIALIZATION METHODS; LOCAL MINIMUMS; REPAIR METHODS; SCHOOL TIMETABLING PROBLEMS; TIMETABLE CONSTRUCTION; UNIVERSITY TIMETABLING PROBLEMS;

HEURISTIC METHODS;

EID: 84957375618     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_20     Document Type: Conference Paper

References (8)

1. Carter, M. W., “A survey of practical applications of examination timetabling algorithms,” Operations Research, Vol. 34, No. 2, pp. 193-202 (1986).
2. Corne, D., Fang, H. L., and Mellish, C., “Solving the modular exam scheduling problem with GAs,” Proceedings of the 1993 International Conference on Industrial and Engineering Application of AI and ES,” (1993).
3. Feldman, R., and Golumbic, M. C., “Constraint satisfiability algorithms for interactive student scheduling,” Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 1010-1016, (1989).
4. Minton, S., Johnston, M. D., Philips, A. B., and Laird, P., “Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems,” Artificial Intelligence, Vol. 58, pp. 160-205 (1992).
5. Schaerf, A., “Tabu search techniques for large high-school timetabling problems,” AAAI-96, pp. 363-368 (1996).
6. Schaerf, A., “Combining local search and look-ahead for scheduling and constraint satisfaction problems,” IJCAI-97, pp. 1254-1259 (1997).
7. Yoshikawa, M., Kaneko, K., Nomura, Y. and Watanabe M., “A constraint-based approach to high-school timetabling problems: A case study,” AAAI-94, pp. 1111-1116 (1994).
8. Yoshikawa, M., Kaneko, K., Yamanouchi, T. and Watanabe M., “A constraint-based high school scheduling system,” IEEE Expert, Vol. 11, No. 1, pp. 63-72 (1996).