Exact solution methods for the Resource Constrained Project Scheduling Problem with a Flexible Project Structure
T. van der Beek (TU Delft - Ship Design, Production and Operations)
J. T. van Essen (TU Delft - Discrete Mathematics and Optimization)
J. F.J. Pruijn (TU Delft - Ship Design, Production and Operations)
Karen I. Aardal (TU Delft - Discrete Mathematics and Optimization)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
The Resource Constrained Project Scheduling Problem with a flexible Project Structure (RCPSP-PS) is a generalization of the Resource Constrained Project Scheduling Problem (RCPSP). The objective of the RCPSP-PS is to find a minimal makespan schedule subject to precedence and resource constraints, while only having to execute a subset of all activities. We present a general model, which is based on a precedence graph and a task selection graph. Furthermore, we introduce an exact solution method including procedures for generating cutting planes and variable reduction. It is shown that both the lower bound obtained from the linear relaxation, and the computation time needed to obtain integer solutions are improved using these procedures.
help_outline