5. The planning method according to claim 4 , further comprising the steps of: a) calculating, by such at least one computational device, at least one cut float value relating to such at least one time-dependent relationship i) wherein such calculation comprises CF j =min [min[H ij +AF j ], H i,m ], where “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; and b) displaying, continuously, by such at least one computational device, such at least one cut float value on such at least one time-scaled calendar on such at least one graphical user interface.
6. The planning method according to claim 5 , further comprising the steps of: a) calculating, by such at least one computational device, at least one reverse float value relating to such at least one time-dependent relationship i) wherein such calculation comprises RF j =min [RF i +H i,j ], for all “I”, where “I” denotes each and every predecessor activity, of a plurality of such predecessor activities to at least one “J” activity and “H i,j ” denotes such at least one relationship float value relating to each and every such predecessor activity; and b) displaying, continuously, by such at least one computational device, such at least one reverse float value on such at least one time-scaled calendar on such at least one graphical user interface.