文档介绍：CostandScheduleManagement42June 2002?LMJoseph 200283Backward PassStartEndJune 2002?LMJoseph 200284Critical Path03030909090150150150180180**********StartEnd03090909015015015018018018030757590303090901501501801801800165120165**********CostandScheduleManagement43June 2002?LMJoseph 200285ExerciseConsider the data, on the next page, for a small software developmentproject (all times are in days).A. Draw work diagram representing the project. Put the nodenumbers in circles and draw arrows from node to node, labelingeach arrow with the activity letter and estimated . Determine how many paths there are in work diagram, andlist the paths and their lengths. For example, a path might bewritten as A-B-E-F-L with a length of 12 . What is the critical path for this project and how long is it?D. What is the shortest time in which this project can pleted?E. Can the critical path ever change on a project?F. Can there be more than one critical path?June 2002?LMJoseph 200286Exercise (cont’d)Activity Initial Node Final Node Estimated Time A 122 B 134 C 245 D 256 E 352 F 363 G 472 H 582 I 594 J 696 K 781 L 8 103 M 9 104CostandScheduleManagement44June 2002?LMJoseph 200287Time ConstraintStartEndJune 2002?LMJo