Constraint-based Planning and Simulation of Multiresource Problems

Constraint-logic methods are suitable for solving complex combinatorial planning and configuration problems which include a large number of constraints. The methods allow to compute near-optimal plans within short computation times. Moreover, the methods are successful in solving multi-resource problems and can be applied to find plans which save resources like energy or material or find solutions for hard problems at all. Enterprises can take advantage of this capability to promote their competitiveness and to react faster on costumer demands, while acting environment-conscious. The techniques are exemplified by a timetabling problem for universities, a job-shop scheduling problem with a restricted electric peak load, a configuration problem of a technical device with low energy consumption, and a material requirements planning problem.