Abstract
As we have seen, maximizing the net present value of a project can be done in polynomial time, if precedence constraints are the only side constraints that have to be taken into account. Unfortunately, things become much more complex, if resource constraints come in as well. We consider here renewable resources. To illustrate the problem, consider an example as provided in Figure 4.1 which has already been used previously (compare Figure 3.1). Again, the lengths of the node boxes indicate the processing times of the activities. For the sake of simplicity, we assume a single renewable resource in the example. The heights of the nodes boxes in Figure 4.1 illustrate the per period resource requests of the activities.
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). Resource-Constrained Scheduling. 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_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1453-4_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5561-8
Online ISBN: 978-1-4615-1453-4
eBook Packages: Springer Book Archive