Resource-Constrained Project Scheduling

  • Peter Brucker
  • Sigrid Knust
Part of the GOR-Publications book series (GOR)


As shown in Section 2.1, even special cases of the RCPSP are NP-hard, i.e. with high probability they cannot be exactly solved in polynomial time. Thus, for larger instances in practice approximation algorithms have to be applied. In this chapter we present different solution methods for the RCPSP with the makespan objective and some of its generalizations (like the multi-mode RCPSP).


Feasible Schedule Partial Schedule Mixed Integer Linear Programming Formulation Transitive Orientation Schedule Generation Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Fachbereich Mathematik/InformatikUniversität OsnabrückOsnabrückGermany

Personalised recommendations