Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brucker, P., Knust, S. (2012). Resource-Constrained Project Scheduling. In: Complex Scheduling. GOR-Publications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23929-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-23929-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23928-1
Online ISBN: 978-3-642-23929-8
eBook Packages: Business and EconomicsBusiness and Management (R0)