A node has one entering activity, a, and two leaving activities, b and c. Given the following information, determine the latest starting time for activity a: EFb = 15, EFc = 17, LFb = 24, LFc = 27; activity times are a = 4, b = 6, c = 8.
A)14
B)15
C)16
D)17
E)18

Question

Quizplus · Accepted Answer

The latest starting time for activity a can be calculated by taking the earliest of the latest finish times of activities b and c (since a must finish before either b or c can start) and subtracting the duration of activity a. The earliest of the latest finish times for b and c is LFb = 24 (since it's less than LFc = 27). Therefore, the latest starting time for a is 24 - 4 = 20. However, there seems to be a misunderstanding in my initial calculation. Correctly, we should consider the earliest finish times of b and c to determine the latest start of a, as a precedes both. The correct approach is to look at the earliest finish times (EFb = 15, EFc = 17) since a must finish for either b or c to start. The latest start time for a would then be based on its own duration and the necessity to finish before the earliest of its subsequent activities begins. Given the mistake in the initial explanation, the correct latest start time for a, considering the need for a revision based on the provided options and the correct understanding of project scheduling, isn't accurately reflected in the initial answer provided. The correct calculation should involve determining the latest start time of a based on its relationship with b and c, considering the earliest it needs to finish to allow subsequent activities to start on time.

A Node Has One Entering Activity, A, and Two Leaving