A logical relationship in which a successor activity cannot start until a predecessor activity has finished is known as:
A. Start-to-start (SS).
B. Start-to-finish (SF).
C. Finish-to-start (FS).
D. Finish-to-finish (FF).
Answer:C
A logical relationship in which a successor activity cannot start until a predecessor activity has finished is known as:
A. Start-to-start (SS). B. Start-to-finish (SF). C. Finish-to-start (FS). D. Finish-to-finish (FF).