Constraint logic programming for examination timetabling

Journal of Logic Programming

Volumn 26, Issue 2 SPEC. ISS., 1996, Pages 217-233

  Boizumault, Patrice ^a   Delon, Yan ^b   Péridy, Laurent ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b UNIVERSITÉ CATHOLIQUE DE L'OUEST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; EDUCATION COMPUTING; OPERATIONS RESEARCH; PROBLEM SOLVING; SCHEDULING;

EXAMINATION TIMETABLING;

LOGIC PROGRAMMING;

EID: 0030085553     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00100-x     Document Type: Article

References (43)

1. Aggoun, A. and Beldiceanu, N., Extending Chip in Order to Solve Complex Scheduling and Placement Problems, in: Journées Francophones de la Programmation en logique, Lille, 1992.
2. Beldiceanu, N. and Contejean, E., Introducing Global Constraints in Chip, Math. Comput. Modelling 20:97-123 (1994).
3. Bellone, J., Chamard, A., and Pradelles, C., Plane: An Evolutive System for Aircraft Production Written in Chip, in: First International Conference on Practical Applications of Prolog, London, 1992.
4. Boizumault, P., Delon, Y., and Péridy, L., Planning Exams Using Constraint Logic Programming, in: Second International Conference on Practical Applications of Prolog, London, 1994.
5. Baptiste, P., Legeard, B., and Varnier, C., Hoist Scheduling Problem: An Approach Based on Constraint Programming, in: IEEE International Conference on Robotics and Automation, Nice, 1992.
6. Borning, A., Maher, M., Martingale, A., and Wilson, M., Constraint Hierarchies and Logic Programming, in: Sixth International Logic Programming Conference, Lisboa, 1989.
7. Boufflet, J. P. and Negre, S., About Planning an Examination Session, in: ECCO VII, Milan, 1994.
8. Barham, A. M. and Westwood, J. B., A Simple Heuristic to Facilitate Course Time-Tabling, J. Oper. Res. Soc. 29:1055-1060 (1978).
9. Carter, M. W., A Survey of Practical Applications of Examination Timetabling Algorithms, Oper. Res. 34:193-202 (1986).
10. Vi Cao, N., du Merle, O., and Vial, J. P., Un Système de Confection Automatisée d'Examens, Rev. Syst. de Décision 1(4):377-399 (1992).
11. Chamard, A. and Fischler, A., A Workshop Scheduler Written in Chip, in: Second International Conference on Practical Applications of Prolog, London, 1994.
12. Chip User's Guide, Cosytec SA, Orsay, France, 1993.
13. Cousin, X., Applications de la Programmation en Logique avec Contraintes au Problème d'Emploi du Temps, Ph.D. thesis, Rennes University, France, 1993.
14. Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., and Berthier, F., The Constraint Logic Programming Language Chip, in: International Conference on Fifth Generation Computer Systems, Tokyo, 1988.
15. Diaz, D., clp(fd) User's Manual, in: Inria, Le Chesney, France, 1994.
16. Desroches, S. and Laporte, G., Examination Timetabling by Computer, Oper. Res., pp. 351-360, 1984.
17. Desroches, S., Laporte, G., and Rousseau, J. M., Horex: A Computer Program for the Construction of Examination Schedules, INFOR 16, 1978.
18. Dincbas, M., Simonis, H., and Van Hentenryck, P., Solving Large Combinatorial Problems in Logic Programming, J. Logic Programming 8(1-2):74-94 (1990).
19. de Werra, D., An Introduction to Time Tabling, European J. Oper. Res. 19:151-162 (1985).
20. de Werra, D., Heuristics for Graph Coloring, Comput. Suppl. 7:191-208 (1990).
21. Dyckhoff, H., A Typology of Cutting and Packing Problems, European J. Oper. Res. 44:145-159 (1990).
22. Fages, F., Fowler, J., and Sola, T., Handling Preferences in Constraint Logic Programming with Relationnal Optimization, in: PLIP'94, 1994.
23. Feldman, R. and Golumbic, M., Optimization Algorithms for Student Scheduling via Constraint Satisfiability, Comput. J. 33(4):356-364 (1990).
24. Glover, F., Tabu Search: Part 1, ORSA J. Comput. 1(3):190-206 (1989).
25. Glover, P., Tabu Search: Part 2, ORSA J. Comput. 2(1):4-32 (1989).
26. Hertz, A. and de Werra, D., Using Tabu Search for Graph Coloring, Comput. 39:345-351 (1987).
27. Harralick, R. and Elliot, G., Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artificial Intelligence 14:263-313 (1980).
28. Van Hentenryck, P., Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA, 1989.
29. Van Hentenryck, P., The Cardinality Operator: A New Logical Connective for Constraint Logic Programming, in: Eighth International Logic Programming Conference, Paris, 1991.
30. Van Hentenryck, P., Scheduling and Packing in the Constraint Language cc(FD), Technical Report, CS Department, Brown University, 1992.
31. Van Hentenryck, P., Saraswat, V., and Deville, Y., Implementation and Evaluation of the Constraint Language cc(FD), Technical Report, CS Department, Brown University, 1992.
32. Jaffar, J. and Maher, M. J., Constraint Logic Programming: A Survey, J. Logic Programming, pp. 503-581, 1994.
33. Jourdan, J. and Sola, T., The Versality of Handling Disjunctions as Constraints, in: PLIP'93, 1993.
34. Lim, P. and Jourdan, J., Workshop on Constraint Languages and Their use in Problem Modelling, in: ILPS'95, Ithaca, New York, 1994.
35. Menez, F., Barahona, P., and Codognet, P., An Incremental Constraint Solver Applied to a Time-Tabling Problem, in: Thirteenth Conference on Expert Systems, Avignon France, 1993.
36. Le Pape, J. P. and Ranson, D., Clef or Programming with Constraints, Logic, Equa-tions and Functions, in: 4th International Conference on Software Engineering and its Applications, Toulouse, France, 1991.
37. Rueher, M. and Legeard, B., Which Role for CLP in Software Engineering? An Investigation on the Basis of First Applications, in: First International Conference on Practical Applications of Prolog, London, 1992.
38. Rueher, M., A First Exploration of PrologIII's Capabilities, Software - Practice and Experience 23(2):177-200 (1993).
39. Simonis, H. and Cornelissens, T., Modelling Producer/Consumer Constraints, in: Workshop on Constraint Languages and Their use in Problem Modelling, ILPS'95, Ithaca, New York, 1994.
40. Rayward-Smith, V. J. and Shing M. T., Bin-Packing, Bulletin of the IMA 19:142-146 (1983).
41. Tripathy, A., School Timetabling: A Case in Large Binary Integer Linear Programming, Management Sci. 30(12):1473-1489 (1984).
42. Tsang, E., Foundations of Constraint Satisfaction, Academic Press, New York, 1993.
43. Wood, D. C., A System for Computing University Examination Timetables, Comput. J., pp. 41-47, 1968.