(D): Based on part (a), draw a boxed AON project network: nodes are boxes with data. By using the forward and backward passes, fill your calculations for ES, EF, LS, LF, and ST. (E): Based on part (d), find the critical path by going through the activities with no slack time. Compare this result with the critical path found in part (c). (F): Independently fill in the columns ES, EF, LS, LF, and ST of the table. If you have difficulties, refer to part (d). Find the activity with the most slack time. Based on the table alone, find the critical path. Compare this result with the critical path found in part (c).
The film The Lord of the Rings: The Return of the King, the last installment of The Lord of the Rings trilogy, was directed by Peter Jackson and released on December 17 2003 in the U.S. with huge success. Eventually, the film won 11 Oscars for all of its nominations. The film's cumulative worldwide box office was $1.14 billion (IMDB). In the film, there are long sequences where the main characters split up in different directions. And, there are big scenes where all the characters reunite. Reflecting upon the film making, we can hypothetically break down the entire cinematic project into the following aggregate activities: (We assume away all the complexities in shooting the three installments at the same time and other production details.)
(D): Based on part (a), draw a boxed AON project network: nodes are boxes with data. By using the forward and backward passes, fill your calculations for ES, EF, LS, LF, and ST.
(E): Based on part (d), find the critical path by going through the activities with no slack time. Compare this result with the critical path found in part (c).
(F): Independently fill in the columns ES, EF, LS, LF, and ST of the table. If you have difficulties, refer to part (d). Find the activity with the most slack time. Based on the table alone, find the critical path. Compare this result with the critical path found in part (c).
*Only need questions D, E, & F*
(A): Based on the table, draw an AON project network: circles/nodes for activities and arrows/arcs for the precedence relationships between activities. Above each node, put a number to represent the activity's normal time.
(B): Draw a Gantt chart in Excel to represent the project
(C): By looking at the chart in part (a), find all possible paths through the network with their corresponding path times. Based on these path times, determine the critical path and its length.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
