A. Aggoun and N. Beldiceanu, Extending chip in order to solve complex scheduling and placement problems, Actes des Journ ees Francophones de Programmation Logique (JFPL'92), pp.51-66, 1992.
URL : https://hal.archives-ouvertes.fr/hal-00442821

D. Applegate and W. Cook, A computational study of the job-shop scheduling problem, ORSA Journal on Computing, vol.3, issue.2, pp.149-156, 1991.

, Special section on logic programming, Communications of ACM, issue.7, p.33, 1992.

J. Alliot and T. Schiex, Intelligence Arti cielle et Informatique Th eorique (in French), Cepadues, 1993.

]. A. Ass-+-88, K. Aiba, Y. Sakai, D. J. Sato, R. Hawley et al., Constraint logic programming language CAL, Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS-88), vol.263, 1988.

K. R. Baker, Introduction to sequencing and scheduling, 1974.

J. Boi and F. Benhamou, Boolean Constraints in Prolog III, 1988.

]. G. Bbd-+-89, E. Bel, D. Bensana, J. Dubois, P. Erschler et al., A knowledge-based approach to industrial job-shop scheduling, pp.207-246, 1989.

J. Bellone, A. Chamard, and A. Fishler, Constraint logic programming decision support systems for planning and scheduling aircraft manufacturing at dassault aviation, Third International Conference on the Practical Application of Prolog (PAP'95), pp.63-67, 1995.

P. Boizumault, Y. Delon, and L. Eridy, Constraint logic programming for examination timetabling, Journal of Logic Programming, 1995.

C. Bessi-ere, E. C. Freuder, and J. C. Egin, Using inference to reduce arc-consistency computation, Proc. of the 14 th IJCAI, 1995.

A. Bockmayr, Logic programming with pseudo-boolean constraints, Constraint Logic Programming: Selected research, pp.327-350, 1993.

, Maybe with the brand-new version of PrologIA, PrologIV, vol.95

R. E. Bryant, Symbolic boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys, vol.24, issue.3, pp.293-318, 1992.

F. Benhamou and T. Vane, Prolog IV : langage et algorithmes, Actes des Journ ees Francophones de Programmation en Logique (JFPL'95), vol.51, 1995.

B. Buchberger, Gr obner bases: An algorithmic method in polynomial ideal theory, Multidimensional Systems Theory, pp.184-232, 1985.

P. Codognet and D. Diaz, Boolean constraints solving using clp(fd), International Logic Programming Symposium, pp.529-539, 1993.

A. Colmerauer, H. Kanoui, and M. Van-caneghem, Prolog, bases th eoriques et d eveloppements actuels. Techniques et Sciences Informatiques, vol.4, pp.271-311, 1983.

W. F. Clocksin and C. S. Mellish, Programming in Prolog, 1981.

J. Cohen, Constraint logic programming languages, Communications of the ACM, vol.33, issue.7, pp.52-68, 1990.

A. Colmerauer, Prolog and in nite trees, Logic Programming, 1982.

A. Colmerauer, PROLOG II reference manual and theoretical model, 1982.

M. C. Cooper, An optimal k-consistency algorithm, Arti cial Intelligence, vol.41, pp.89-95, 1989.

. Cosytec, Chip Reference Manual, 1993.

J. Carlier and E. Pinson, Adjustment of heads and tails for the job-shop problem, European Journal of Operational Research, vol.78, pp.146-161, 1994.

E. Davis, Constraint propagation with interval labels, Arti cial Intelligence, vol.32, issue.3, pp.281-331, 1987.

J. De-kleer, A comparison of ATMS and CSP techniques, Proc. of the 11 th IJCAI, pp.290-296, 1989.

M. Davis and H. Putnam, A computing procedure for quanti cation theory, Journal of the ACM, vol.7, issue.3, pp.210-215, 1960.

M. Dincbas, H. Simonis, and P. Van-hentenryck, Solving Large Combinatorial Problems in Logic Programming, Journal of Logic Programming, vol.8, issue.1-2, pp.74-94, 1990.

J. Erschler, F. Roubellat, and J. Vernhes, Finding some essential characteristics of the feasible solutions for a scheduling problem, Operations Research, vol.24, issue.4, pp.774-783, 1976.

J. Erschler, F. Roubellat, and J. Vernhes, Characterizing the set of feasible sequences for n jobs to be carried out on a single machine, European Journal of Operational Research, vol.4, issue.3, pp.189-194, 1980.

, FAQ of the comp.constraints newsgroup. Available at URL, 1995.

E. C. Freuder, Synthesizing constraint expressions, Communications of the ACM, vol.21, pp.958-966, 1978.

H. Fisher and G. L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, pp.225-251, 1963.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, 1979.

. Gotha, Les probl emes d'ordonnancement. RAIRO-RO, vol.27, pp.77-150, 1993.

S. C. Graves, A review of production scheduling, Operations Research, vol.29, pp.646-675, 1981.

. C. Hjm-+-92]-n, J. Heintze, S. Ja-ar, P. J. Michaylov, R. H. Stuckey et al., The CLP(R) Programmer's Manual. IBM, PO Box, vol.704, 1992.

T. Huynh and C. Lassez, A CLP(R) options trading analysis system, JICSLP'88: Proceedings 5th International Conference and Symposium on Logic Programming, pp.59-69, 1988.

N. Heintze, S. Michaylov, and P. Stuckey, CLP(R) and some electrical engineering problems, Journal of Automated Reasoning, vol.9, pp.231-260, 1992.

J. N. Hooker, A quantitative approach to logical inference. Decision Support Systems, vol.1, pp.45-69, 1988.

E. Hyv-onen, Constraint reasoning based on interval arithmetic: the tolerance propagation approach, Arti cial Intelligence, vol.58, pp.71-112, 1992.

J. Imbert, Fourier's elimination: Which to choose?, First Workshop on Principles and Practice of Constraint Programming, pp.119-131, 1993.

J. , J. , and J. Lassez, Constraint logic programming, POPL'87: Proceedings 14th ACM Symposium on Principles of Programming Languages, pp.111-119, 1987.

J. and M. J. Maher, Constraint logic programming: a survey, The Journal of Logic Programming, vol.19, issue.20, pp.503-581, 1994.

J. Ja-ar, M. J. Maher, P. J. Stuckey, and R. Yap, Projecting clp(<) constraints, New Generation Computing, vol.11, pp.449-469, 1993.

N. Karmarkar, A new polynomial time algorithm for linear programming, Combinatorica, vol.4, pp.373-395, 1984.

L. G. Khachian, A polynomial algorithm in linear programming, Soviet Math. Dokl, vol.20, issue.1, pp.191-194, 1979.

R. E. Korf, Depth rst iterative deepening : An optimal admissible tree search, Arti cial Intelligence, vol.27, pp.97-109, 1985.

R. A. Kowalski, Logic for Problem Solving, 1979.

O. Lhomme, Consistency techniques for numeric CSPs, Proc. of the 13 th IJCAI, pp.232-238, 1993.

J. Lassez and K. Mcalloon, A canonical form for generalized constraints, J. Symbolic Computation, vol.13, pp.1-24, 1992.

A. K. Mackworth, Consistency in networks of relations, Arti cial Intelligence, vol.8, pp.99-118, 1977.

S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method, Proc. of AAAI-90, pp.17-24, 1990.

B. L. Mccarthy and J. Liu, Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling, International Journal of Production Research, vol.31, issue.1, pp.59-79, 1993.

U. Montanari, Network of constraints: Fundamental properties and applications to picture processing, Inf. Sci, vol.7, pp.95-132, 1974.

B. A. Nadel, Constraint satisfaction algorithms, Comput. Intell, vol.5, issue.4, pp.188-224, 1989.

W. P. Nuijten, Time and resource constrained scheduling, 1994.

C. and L. Pape, Implementation of resource constraints in ilog-schedule: A library for the development of constraint-based scheduling systems, Intelligent Systems Engineering, vol.3, pp.55-66, 1994.

M. Pinedo, Scheduling: Theory, Algorithms and Systems, 1995.

C. , L. Pape, J. Puget, C. Moreau, and P. Darneau, PMFP: The use of constraintbased programming for predictive personnel management, Proc. of the 11 st ECAI, 1994.

J. Puget, Object oriented constraint programming for transportation problems, Proc. of ASTAIR'92, 1992.

J. Puget, A C++ implementation of CLP, 1994.

M. S. Paterson and M. N. Wegman, Linear uni cation, JCSS, vol.16, pp.158-167, 1978.

J. and A. Robinson, A machine-oriented logic based on the resolution principle, Journal of the ACM, vol.12, pp.23-44, 1965.

G. Sidebottom and W. S. Havens, Hierarchical arc consistency applied to numeric processing in constraint logic programming, 1991.

G. L. Steele, The de nition and implementation of a computer programming language based on constraints, 1980.

E. P. Tsang, Foundations of Constraint Satisfaction, 1993.

J. R. Ullman, Associating parts of patterns, Inform. Contr, vol.9, pp.583-601, 1966.

P. Van-hentenryck, Constraint Satisfaction in Logic Programming. Logic Programming Series, 1989.

P. Van-hentenryck and Y. Deville, The cardinality operator: A new logical connective for constraint logic programming, Constraint Logic Programming: Selected research, pp.383-403, 1993.

P. Van-hentenryck, Y. Deville, and C. Teng, A generic arc-consistency algorithm and its specializations, Arti cial Intelligence, vol.57, pp.291-321, 1992.

D. L. Waltz-;-m and M. A. Cambridge, Generating semantic descriptions from drawings of scenes with shadows, 1972.

M. Wallace, Applying constraints for scheduling, Constraint Programming: Proceedings 1993 NATO ASI Parnu, Estonia, NATO Advanced Science Institute Series, pp.161-180, 1994.

R. H. Yap, A constraint logic programming framework for constructing DNA restriction maps, Arti cial Intelligence in Medicine, vol.5, pp.447-464, 1993.