28. The planning method according to claim 27 , further comprising the step of calculating, by such at least one computational device, at least one activity float value relating to such at least one time-dependent relationship wherein such calculation comprises AF i =min [H i,j +AF j ], for all “J”, wherein “J” denotes each and every successor activity of a plurality of such successor activities to at least one “I” activity and “H i,j ” denotes such at least one relationship float value relating to each and every such successor activity.
28. The planning method according to claim 27 , further comprising the step of calculating, by such at least one computational device, at least one activity float value relating to such at least one time-dependent relationship wherein such calculation comprises AF i =min [H i,j +AF j ], for all “J”, wherein “J” denotes each and every successor activity of a plurality of such successor activities to at least one “I” activity and “H i,j ” denotes such at least one relationship float value relating to each and every such successor activity. 29. The planning method according to claim 28 , further comprising the step of calculating, by such at least one computational device, at least one cut float value relating to such at least one time-dependent relationship wherein such calculation comprises CF i =min [min[H i,j +AF j ], H i,m ], wherein “H i,m ” denotes the such at least one relationship float value between such at least one “I” activity and a connected, one milestone deadline.