Decomposing and solving timetabling constraint networks

Computational Intelligence

Volumn 13, Issue 4, 1997, Pages 486-505

  Meisels, Amnon ^a   Ell Sana, Jihad ^a   Gudes, Ehud ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Constraint satisfaction problems; Heuristic search; Timetabling

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

CONSTRAINT SATISFACTION PROBLEMS (CSP); HEURISTIC SEARCH; SCHOOL TIMETABLING (STT) PROBLEMS;

CONSTRAINT THEORY;

EID: 0031269073     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00049     Document Type: Article

References (26)

1. CHEESEMAN, P., B. KANEFSKY, and W. M. TAYLOR. 1991. Where the really hard problems are. In Proceedings of the IJCAI-91, Sydney, pp. 331-337.
2. CHOUEIRY, Y. B., and B. FALTINGS. 1994. A decomposition heuristic for resource allocation. In Proceedings of the ECAI-94, Amsterdam, pp. 585-594.
3. DECHTER, R. 1990. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence Journal, 41:273-312.
4. DECHTER, R. 1992. Constraint networks. In Encyclopedia of Artificial Intelligence, 2nd Edition. John Wiley & Sons, New York, pp. 276-285.
5. DECHTER, R., and I. MEIRI. 1989. Experimental evaluation of preprocessing techniques in constraint satisfaction problems. In Proceedings of the IJCAI-89, pp. 271-77.
6. DECHTER, R., and J. PEARL. 1987. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence Journal, 34(1):1-38.
7. ELL-SANA, J. 1993. CSP algorithms applied to timetabling. M.Sc. thesis, Ben-Gurion University.
8. ERDOS, P., and J. KOPLANSKY. 1946. The asymptotic number of Latin rectangles. American Journal Mathematics, 69:230-236.
9. FREUDER, E. C. 1982. A sufficient condition for backtrack free search. Journal of ACM, 29:24-32.
10. FREUDER, E. C. 1985. A sufficient condition for backtrack-bounded search. Journal of ACM, 32:755-761.
11. GAREY, M. R., and D. S. JOHNSON. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
12. GEELEN, P. 1992. Dual viewpoint heuristics for binary CSPs. In Proceedings of the ECAI-92, Vienna, pp. 31-35.
13. GOLUMBIC, M. C. 1984. Algorithmic aspects of perfect graphs. Annals of Discrete Mathematics, 21:301-323.
14. GOLUMBIC, M., and R. FELDMAN. 1990. Interactive scheduling as a constraint satisfaction problem. Annals of Mathematics and AI, 1:49-73.
15. LEWANDOWSKI, G., and A. CONDON. 1994. Experiments with parallel graph coloring heuristics. In Proceedings of the 2nd DEMACS Challenge.
16. MACKWORTH, A. K. 1977. Consistency in networks of relations. Artificial Intelligence. 8:99-118.
17. PROSSER, P. 1993. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9:268-99.
18. PROSSER, P. 1994. Binary constraint satisfaction problems: Some are harder than others. In Proceedings of the ECAI 94, Amsterdam, pp. 95-104.
19. REGINI, J. C. 1994. A filtering algorithm for constraints of difference in CSPs. In Proceedings of the AAAI-94, Seattle, WA, pp. 362-367.
20. ROSSI, F. 1995. Redundant hidden variables in finite domain constraint problems. In Constraint Processing, LNCS 923. Springer Verlag, pp. 205-223.
21. SMITH, B. 1994. Phase transition and the mushy region in CSP. In Proceedings of the ECAI-94, Amsterdam, pp. 100-104.
22. SOLOTOREVSKY, G., E. GUDES, and A. MEISELS. 1994. RAPS - A rule-based language for specifying resource allocation problems. IEEE Transactions on Data and Knowledge Engineering, 6:681-698.
23. TSANG, E. 1993. In Foundations of Constraint Satisfaction. Academic Press.
24. VAN BEEK, P. 1994. On the inherent level of local consistency in constraint networks. In Proceedings of the AAAI-94, Seattle, WA, pp. 100-110.
25. VAN BEEK, P., and R. DECHTER. 1994. Constraint tightness versus global consistency. In Proceedings of the KR-94. Bonn.
26. YOSHIKAWA, M. et al. 1996. A constraint-based high school scheduling system. IEEE Expert, 11(1):63-72.