• Provide an integrated approach to planning and scheduling decisions.
  
  
• The total number of network realizations to be evaluated to select the best solution is n1*n2*n3* … *nm, if the project graph has m decision nodes, the first with n1 choices, the second with n2 choices and so on.
  
  
• Combinatorial problem with huge computational burden.