Constraint logic programming and scheduling problems

Classical approaches for the resolution of combinatorial problems are of two kinds: exact methods or approximate ones. Scheduling problems enter in this framework. Up to now, operational research tools were proposed to consider such problems. Recently, new resolution methods were developed. This is the case for the family of stochastic methods or genetic algorithms. But, real life problem that come from the industrial environment require more flexible tools. This is the purpose of constraint logic programming approach. It allows one to ally versatility and efficiency. We will show in this paper, why this new generation of tools seems to be interesting for solving scheduling problems.