References

• 1961Critical-Path Planning and Scheduling: Mathematical Basis902 cited
• 1959Critical-path planning and scheduling623 cited
• 1983Project Management With Cpm, Pert and Precedence Diagramming400 cited
• 1961A Network Flow Computation for Project Cost Curves366 cited
• 1963MONTE CARLO METHODS AND THE PERT PROBLEM240 cited
• 1971A Simple CPM Time-Cost Tradeoff Algorithm223 cited
• 1997Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks209 cited
• 2001A GA-based fuzzy optimal model for construction time–cost trade-off182 cited
• 1996Optimal procedures for the discrete time/cost trade-off problem in project networks157 cited
• 1992The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)156 cited
• 1979A Dynamic Programming Algorithm for Decision CPM Networks117 cited
• 1999Using Machine Learning and GA to Solve Time-Cost Trade-Off Problems112 cited
• 1998New computational results on the discrete time/cost trade-off problem in project networks107 cited
• 2015Handbook on Project Management and Scheduling Vol.1103 cited
• 2002Discrete time/cost trade-offs in project scheduling with time-switch constraints