Details

Autor(en) / Beteiligte

• Berthold, Timo
• Heinz, Stefan
• Lübbecke, Marco E.
• Möhring, Rolf H.
• Schulz, Jens

Titel

A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling

Ist Teil von

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, p.313-317

Ort / Verlag

Berlin, Heidelberg: Springer Berlin Heidelberg

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of practical relevance. Jobs have to be scheduled on (renewable) resources subject to precedence constraints such that the resource capacities are never exceeded and the latest completion time of all jobs is minimized. The problem has challenged researchers from different communities, such as integer programming (IP), constraint programming (CP), and satisfiability testing (SAT). Still, there are instances with 60 jobs which have not been solved for many years. The currently best known approach, lazyFD, is a hybrid between CP and SAT techniques. In this paper we propose an even stronger hybridization by integrating all the three areas, IP, CP, and SAT, into a single branch-and-bound scheme. We show that lower bounds from the linear relaxation of the IP formulation and conflict analysis are key ingredients for pruning the search tree. First computational experiments show very promising results. For five instances of the well-known PSPLib we report an improvement of lower bounds. Our implementation is generic, thus it can be potentially applied to similar problems as well.