View article

In this paper we deal with a complex real world scheduling problem closely related to the well-known Resource-Constrained Project Scheduling Problem (RCPSP). The problem concerns industrial test laboratories in which a large number of tests has to be performed by qualified personnel using specialised equipment, while respecting deadlines and other constraints. We present different constraint programming models and search strategies for this problem. Our approaches are evaluated using CP solvers and a MIP solver on a set of generated instances of different sizes. With our best approach we could find feasible and several optimal solutions for instances that are generated based on real-world test laboratory problems.