Building university timetables using constraint logic programming

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

Volumn 1153, Issue , 1996, Pages 130-145

  Gueret, Christelle ^a,b   Jussien, Narendra ^a   Boizumault, Patrice ^a   Prins, Christian ^a  

^a ECOLE DES MINES DE NANTES   (France)

^b Institut de Mathematiques Appliquees   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958739675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61794-9_56     Document Type: Conference Paper

References (46)

1. Abderrahmane Aggoun and Nicolas Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling, 17(7):57-73, 1993
2. P. Baptiste, C. Le Pape, and W. Nuijten. Incorporating efficient Operations Research algorithms in constraint-based scheduling. In 1st Joint Workshop on Artificial Intelligence and Operational Research, 1995. To appear
3. N. Beldiceanu and E. Contjean. Introducing global constraints in CHIP. Mathematical and Computer Modelling, 20(12):97-123, 1994
4. Jacques Bellone, Andre Chamard, and C. Pradelles. Plane: An evolutive system for aircraft production written in CHIP. In Proceedings of the First International Conference on Practical Applications of Prolog, London, 1992
5. Christian Bessiere. Arc consistency in dynamic constraint satisfaction problems. In Proceedings AAAI’91, 1991
6. Christian Bessiere. Arc consistency for non-binary dynamic CSPs. In Proceedings ECAP9&, 1992
7. Patrice Boizumault, Yann Delon, and Laurent Peridy. Constraint logic programming for examination timetabling. To appear in Journal of Logic Programming, 1995
8. Patrice Boizumault, Christelle Gueret, and Narendra Jussien. Efficient labeling and constraint relaxation for solving time tabling problems. In Pierre Lim and Jean Jourdan, editors, Proceedings of the 1994 ILPS post-conference workshop on Constraint Languages/Systems and their use in Problem Modeling: Volume 1 (Applications and Modelling), Technical Report ECRC-94-38, ECRC, Munich, Germany, November 1994
9. Alan Boming, Michael Maher, Amy Martindale, and Molly Wilson. Constraint hierarchies and logic programming. In Giorgio Levi and Maurizio Martelli, editors, ICLP’89: Proceedings 6th International Conference on Logic Programming, pages 149-164, Lisbon, Portugal, June 1989. MIT Press
10. J. P. Boufflet and S. Negre. About planning an examination session. In Proceedings ECCO VII, Conference of the European Chapter on Combinatorial Optimization, Milan, Italy, February 1994
11. J. P. Boufflet and S. Negre. A practical timetable problem. In EURO XII, Operations Research Designing Practical Solutions, Glasgow, United Kingdom, July 1994
12. Bull SA. AMPHI+ user’s guide, 1992
13. Edmund Burke, David Elliman, and Rupert Weare. A Genetic Algorithm for university timetabling. In AISB Workshop on Evolutionary Computing, University of Leeds, UK, April 1994
14. M. Cangalovie and J.A.M. Schreuder. Exact algorithm fro weighted graphs applied to timetabling problems with lectures of different lengths. European Journal of Operations Research, 1991
15. M. W. Carter. A survey of practical applications of examination timetabling algorithms. European Journal of Operations Research, 34(2), 1986
16. Y. Caseau and F. Laburthe. Improved CLP scheduling with task intervals. In 11th International Conference on Logic Programming, 1994
17. Andre Chamard, Frederic Deces, and Annie Fischler. Applying CHIP to a complex scheduling problem. In JICSLP’92, Washington, DC, November 1992. (Submitted). Cosytec SA. CHIP v4 reference manual, 1993
18. Xavier Cousin. Application de la programmation logique avec contraintes an prob-leme d’emploi du temps. PhD thesis, Universite de Rennes I, France, 1993. In French
19. Dominique de Werra. An introduction to timetabling. European Journal of Operational Research, 19:151-162, 1985
20. Mehmet Dincbas, Helmut Simonis, and Pascal Van Hentenryck. Solving a Cutting-Stock Problem in Constraint Logic Programming. In Robert Kowalski and Kenneth Bowen, editors, ICLP’88: Proceedings 5th International Conference on Logic Programming, pages 42-58, Seattle, WA, August 1988. MIT Press
21. Mehmet Dincbas, Helmut Simonis, and Pascal Van Hentenryck. Solving the Car Sequencing Problem in Constraint Logic Programming. In ECAI-88: European Conference on Artificial Intelligence, Munich, August 1988
22. Mehmet Dincbas, Helmut Simonis, and Pascal Van Hentenryck. Solving Large Combinatorial Problems in Logic Programming. Journal of Logic Programming, 8(l-2):74-94, January-March 1990
23. Mehmet Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and Berthier. The Constraint Logic Programming Language CHIP. In FGCS-88: Proceedings International Conference on Fifth Generation Computer Systems, pages 693-702, Tokyo, December 1988
24. ICOT. Frangois Fages, Julian Fowler, and Thierry Sola. Handling preferences in constraint logic programming with relational optimization. In PLILP’94, Madrid, September 1994
25. R. Feldman and M.C. Golumbic. Optimization algorithms for student scheduling via constraint satisfiability. The Computer Journal, 33(4), 1990
26. Kenneth D. Forbus and Johan de Kleer. Building Problem Solvers. MIT Press, Cambridge, 1993.
27. Julian Fowler. Preferred constraints as optimization. In Proceedings Journees Frangaises de Programmation en Logique, 1993
28. Eugene Freuder. Partial constraint satisfaction. In IJCA1-89: Proceedings 11th International Joint Conference on Artificial Intelligence, pages 278-283, Detroit, 1989
29. F. Glover. Tabu search. CAAI Report 88-3, University of Colorado, 1988.
30. F. Glover. Tabu search: a tutorial. Interfaces, 20:74-94, 1990
31. A. Hertz and D. de Werra. Using tabu search techniques for graph coloring. Computing, 39:345-351, 1987
32. Michael Jampel and David Gilbert. Fair Hierarchical Constraint Logic Programming. In Manfred Meyer, editor, Proceedings ECAI’94 Workshop on Constraint Processing, Amsterdam, August 1994
33. Philippe Jegou. Contribution a Vetude des problemes de satisfaction de con-traintes: Algorithmes de propagation et de resolution-Propagation de contraintes dans les reseaux dynamiques. These de doctorat, Universite des Sciences et Techniques du Languedoc, Montpellier, France, January 1991. In French
34. Francisco Menezes, Pedro Barahona, and Philippe Codognet. An incremental hierarchical constraint solver. In Paris Kanellakis, Jean-Louis Lassez, and Vijay Saraswat, editors, PPCP’93: First Workshop on Principles and Practice of Constraint Programming, Providence RI, 1993
35. C, Le Pape. Programmation par contraintes: une nouvelle forme de debat entre recherche operationnelle et intelligence artificielle. Bulletin de I’AFIA, (21), April 1995
36. Projet CSPFlex., Gerard Bel, Eric Bensana, Khaled Ghedira, David Lesaint, Thomas Schiex, Gerard Verfaillie, Christine Gaspin, Roger Maxtin-Clouaire, Jean-Pierre Rellier, Pierre Berlandier, Bertrand Neveu, Brigitte Trousse, Hene Fargier, Jerome Lang, Philippe David, Philippe Jansenn, Tibor Kokeny, Marie-Catherine Vilarem, and Philippe Jegou. Representation et traitement pratique de la flexibil-ite dans les problemes sous contraintes. In Actes des Journees Nationales du PRC GDR Intelligence Artificielle, Marseille, France, October 1992. In French
37. Michel Rueher. A first exploration of Prolog-IIPs capabilities. Software-Practice and Experience, 23, 1993.
38. Michel Rueher and Bruno Legeard. Which role for CLP in software engineering? An investigation on the basis of first applications. In Proceedings of the First International Conference on Practical Applications of Prolog, London, 1992
39. Smith and Shing Bin packing. Bulletin of the IMA, 19, 1983
40. Arabinda Tripathy. A lagrangean relaxation approach to course timetabling. Journal of Operational Research Society, 31:599-603, 1980
41. Arabinda Tripathy. School timetabling-a case in large binary integer Unear programming. Management Science, 30(12), 1984.
42. Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
43. Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, Cambridge, MA, 1989.
44. Pascal Van Hentenryck. Incremental constraint satisfaction in logic programming. In Proceedings 6th International Conference on Logic Programming, 1989
45. G. M. White and L. Kang. A logic approach to the resolution of constraints in timetabling. European Journal of Operations Research, 61:306-317, 1992
46. M. Yoshikawa, K. Kaneko, Y. Yomura, and M. Watanabe. A constraint-based approach to high-school timetabling problems: A case study. In Proceedings of AAAI’94 Conference, 1994.