The following information is available about a tiny project Activity time (days) Immediate predecessor(s) 5 Activity...

 

Transcribed Image Text:

The following information is available about a tiny project Activity time (days) Immediate predecessor(s) 5 Activity A BCD E F G H I J K 4 6 3 1 2 5 7 3 4 1 A B, C, D E, F F G G H a. Draw the network diagram b. Find the critical path and calculate how much slack each activity has You should add the ES, EF, LS, LF and slack numbers of the phases to the network model of the project (the picture can be drawn even by hand). The data should also be presented in tabular form the critical path is a set of steps from the beginning to the end of the project that defines the maximum of the project duration. It cannot end in the middle of the project and it cannot start in the middle of the project the numbers of the phases LF and LS are calculated from the end of the project towards the beginning and they are the phases in terms of the duration of the project last possible finishing and starting moments. In order not to delay the project, its last (or several in the case of a phase, the last) activity must be completed within the duration of the project (using the critical path defined project duration (=> EF=LF of last phase)). Accordingly, the phase in question should start it a duration earlier (=> LS of the last stage). The step before the last step will hold accordingly to complete (i.e. the LF of the penultimate stage) so that the last stage can start on time (i.e. the second last LF = LS of last stage). This is how we continue from the end of the project to its beginning. The critical path the early and late values of the phases are naturally the same. The following information is available about a tiny project Activity time (days) Immediate predecessor(s) 5 Activity A BCD E F G H I J K 4 6 3 1 2 5 7 3 4 1 A B, C, D E, F F G G H a. Draw the network diagram b. Find the critical path and calculate how much slack each activity has You should add the ES, EF, LS, LF and slack numbers of the phases to the network model of the project (the picture can be drawn even by hand). The data should also be presented in tabular form the critical path is a set of steps from the beginning to the end of the project that defines the maximum of the project duration. It cannot end in the middle of the project and it cannot start in the middle of the project the numbers of the phases LF and LS are calculated from the end of the project towards the beginning and they are the phases in terms of the duration of the project last possible finishing and starting moments. In order not to delay the project, its last (or several in the case of a phase, the last) activity must be completed within the duration of the project (using the critical path defined project duration (=> EF=LF of last phase)). Accordingly, the phase in question should start it a duration earlier (=> LS of the last stage). The step before the last step will hold accordingly to complete (i.e. the LF of the penultimate stage) so that the last stage can start on time (i.e. the second last LF = LS of last stage). This is how we continue from the end of the project to its beginning. The critical path the early and late values of the phases are naturally the same.