25 points) Draw the network AON for this project Activity Time (hours) Immediate Predecessors A 1.5 NONE B 1.0 NONE C 2.0 A D 1.5 A, B E 1.0 C.D a. What are the ES, EF, LS and LF of the project? b. What is the duration of the project? c. What are the slack times of the activities? d. What is the Critical Path?

2. (25 points) Given the table below Task Time (weeks) Immediate Predecessors A. Perform market survey 3 NONE B. Design graphic icons 4 A C. Develop flowchart 2 A D. Design input/output screens 6 B, C E. Module 1 coding 5 C F. Module 2 coding 3 C G. Module 3 coding 7 E H. Module 4 coding 5 E, F I. Merge modules and graphics and test programs 8 D,G,H a. Draw the Network b. What are the ES, EF, LS and LF of the project? c. What is the duration of the project d. What are the slack times of the activities? e. What is the Critical Path?

3. (50 points) Consider the following project time and cost data: a. Develop a network for this project. b. Compote earliest and latest starting and finish times for each of the activities. Find the slack time for each activity and identify the critical path. c. Find the optimal number of days to perform the project by expediting one day at a time. What is the total project cost at the optimal solution? Activity Immediate Predecessors Normal Time (day) Expedited Time (day) Normal Cost $ Expedite Cost $ Crash Cost per period to calculate A None 6 6 200 200 B A 10 4 600 1000 C A 12 9 625 1000 D B 6 5 700 800 E B 9 7 200 500 F C,D 9 5 400 840 G E 14 10 1000 1440 H E,F 10 8 1100 1460 Note: 1. the formula to calculate crash cost per period is equal to (crash cost normal cost)/(normal time crash time) 2. If the normal time is equal to the expedite time the normal cost is equal to expedite cost. This means that those activities cannot be crashed. 3. If one (or more) activity is (are) not an immediate predecessor(s) to any other activity, this activity (ies) is (are) going to the end.