Efficient labeling and Constraint Relaxation for Solving Time Tabling Problems

Constraint Logic Programming over Finite Domains, CLP(FD), has been in constant development for a few years. CLP(FD) allows an efficient resolution of various highly combinatorial problems in scheduling, cutting-stock, warehouse location, planning, molecular biology ... [DIN 90a,b,c], [BAP 92], [BEL 92], [CHA 92], [CLA 93], [BOI 94b]. From a software engineering view point, this approach provides an easy prototyping and induces rapid development times. This is due to the integration of a powerful constraint propagation mechanism (Consistency Techniques) in a Logic Programming language (Prolog).

[1]  André Chamard,et al.  Application du langage CHIP à un problème complexe d'ordonnancement , 1992, JFPL.

[2]  Bjørn N. Freeman-Benson,et al.  An incremental constraint solver , 1990, CACM.

[3]  Julian Fowler.  Preferred constraints as optimization , 1993, JFPL.

[4]  Bruno Legeard,et al.  Hoist scheduling problem: an approach based on constraint logic programming , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[5]  Mirjana Cangalovic,et al.  Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths , 1991 .

[6]  Philippe Codognet,et al.  An Incremental Hierarchical Constraint Solver , 1993, PPCP.

[7]  Michael W. Carter,et al.  OR Practice - A Survey of Practical Applications of Examination Timetabling Algorithms , 1986, Oper. Res..

[8]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[9]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

[10]  Xavier Cousin.  Application de la programmation en logique avec contraintes au probleme d'emploi du temps , 1993 .

[11]  George M. White,et al.  A logic approach to the resolution of constraints in timetabling , 1992 .

[12]  Arabinda Tripathy.  A Lagrangean Relaxation Approach to Course Timetabling , 1980 .

[13]  Pascal Van Hentenryck,et al.  Solving a Cutting-Stock Problem in Constraint Logic Programming , 1988, ICLP/SLP.

[14]  Masazumi Yoshikawa,et al.  A Constraint-Based Approach to High-School Timetabling Problems: A Case Study , 1994, AAAI.

[15]  Pascal Van Hentenryck.  Incremental Constraint Satisfaction in Logic Programming , 1990, ICLP.

[16]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[17]  Jean-Paul Boufflet.  Emplois du temps dans un environnement fortement contraint : exemple de l'U.T.C , 1992 .

[18]  Pascal Van Hentenryck,et al.  Solving Large Combinatorial Problems in Logic Programming , 1990, J. Log. Program..

[19]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[20]  Philippe Jégou.  Contribution à l'étude des problèmes de satisfaction de contraintes : algorithmes de propagation et de résolution : propagation de contraintes dans les réseaux dynamiques , 1991 .

[21]  A. Tripathy.  School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[22]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[23]  Christopher J. Rawlings,et al.  Solving Large Combinatorial Problems in Molecular Biology Using the ElipSys Parallel Constraint Logic Programming System , 1993, Comput. J..

[24]  Nicolas Beldiceanu,et al.  Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.

[25]  Michel Rueher.  A first exploration of PrologIII's capabilities , 1993, Softw. Pract. Exp..