Berthold, TimoHeinz, StefanLübbecke, Marco E.Möhring, Rolf H.Schulz, Jens2021-12-172021-12-1720102197-8085https://depositonce.tu-berlin.de/handle/11303/15701http://dx.doi.org/10.14279/depositonce-14474We 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.en510 Mathematikschedulingresource-constrainedconstraint integer programminghybrid approachA Constraint Integer Programming Approach for Resource-Constrained Project SchedulingResearch Paper