Abstract
We already observed that maximizing the net present value of a project under resource constraints is an NP-hard optimization problem in general. And we have mentioned that the new aspect that comes in, if we add resource constraints to the central problem, is that we have to find a partial order of the activities that augments the partial order defined by the precedence constraints. By having this insight, it seems promising to explore the use of considering activity-on-node networks for which finding a partial order is not necessary.
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
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kimms, A. (2001). Network Decomposition. In: Mathematical Programming and Financial Objectives for Scheduling Projects. International Series in Operations Research & Management Science, vol 38. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1453-4_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1453-4_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5561-8
Online ISBN: 978-1-4615-1453-4
eBook Packages: Springer Book Archive