Abstract
In this chapter we introduce the reader to the original CPM problem and its several solutions. The original CPM problem is a cost optimization problem. Nowadays, the simple CPM time analysis problem, which is the first phase of the original CPM problem, is called the CPM problem. For the cost optimization model we use the CPM/cost, CPM time-cost trade-off or CPM least-cost scheduling terms.
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
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Hajdu, M. (1997). CPM Least Cost Scheduling. In: Network Scheduling Techniques for Construction Project Management. Nonconvex Optimization and Its Applications, vol 16. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5951-8_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5951-8_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4765-9
Online ISBN: 978-1-4757-5951-8
eBook Packages: Springer Book Archive