Experiments on networks of employee timetabling problems

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

Volumn 1408, Issue , 1998, Pages 130-141

  Meisels, Amnon ^a   Lusternik, Natalia ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Constraint networks; Employee timetabling; Experimental CSP; Non binary constraints

Indexed keywords

PERSONNEL; SCHEDULING; TESTBEDS;

BINARY CONSTRAINT NETWORK; CONFLICT-DIRECTED BACKJUMPING; CONSTRAINT NETWORKS; EMPLOYEE TIMETABLING; EMPLOYEE TIMETABLING PROBLEMS; EXPERIMENTAL CSP; NATURAL REPRESENTATION; NON-BINARY CONSTRAINTS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84957025767     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055885     Document Type: Conference Paper

References (15)

1. M. Arkin and E. B. Silverberg. Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18:1-8, 1987.
2. P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 331-337, Sydney, Australia, 1991.
3. B. Y. Choueiry and B. Faltings. Temporal abstractions and a partitioning heuristic for interactive resource allocation. In Notes of Workshop on Knowledge-based Production Planning, Scheduling and Control, IJCAI-93, pages 59-72, Chambery, France, 1993.
4. D. Corne, P. Ross, and Hsiao-Lan Fang. Fast practical evolutionary timetabling. Lecture Notes in Computer Science, 865:250-263, 1994.
5. R. Dechter. Constraint networks. In S. C. Shapiro, editor, Encyclopedia of Artificial Intelligence, 2nd Edition, pages 276-285. John Wiley & Sons, 1992.
6. R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34:1-38, 1988.
7. R. Dechter and P. Van Beek. Constraint tightness and looseness versus local and global consistency. J. of ACM, 44:549-566, 1997.
8. M. C. Golumbic. Algorithmic aspects of perfect graphs. Annals of Discrete Mathematics, 21:301-323, 1984.
9. S.A. Grant and B.M. Smith. The phase transition behaviour of maintaining arc consistency. In Proceedings of the 12th European Conference on Artificial Intelligence, pages 175-179, Budapest, Hungary, 1996.
10. P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9:268-299, 1993.
11. P. Prosser. Binary constraint satisfaction problems: some are harder than others. In Proceedings of the 11th European Conference on Artificial Intelligence, pages 95-99, Amsterdam, 1994.
12. P. Ross, D. Corne, and H. Terashima. The phase transition niche for evolutionary algorithms in timetabling. In Proceedings of the 1st Conference on Practice and Applications of Automated Timetabling, pages 269-282, Edinburgh, UK, August, 1995.
13. B. M. Smith. Phase transition and the mushy region in csp. In Proceedings of the 11th European Conference on Artificial Intelligence, pages 100-104, Amsterdam, The Netherlands, 1994.
14. G. Solotorevsky, E. Shimony, and A. Meisels. Csps with counters: a likelihoodbased heuristic. In Proc. Workshop on Non Standard Constraint Processing, ECAI96, pages 107-118, Budapest, August, 1996.
15. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.