A program is broken down into a set of tasks with the following characteristics:
|Task Number||Task Name||Duration (weeks)||Precursor Tasks|
|6||Foxtrot||7||5, 11, 17|
|7||Golf||6||5, 6, 11|
|12||Lima||6||11, 17, 23|
|18||Romeo||6||17, 22, 23|
|19||Sierra||2||6, 12, 18|
|24||Xray||3||18, 22, 23|
|26||Zulu||1||7, 19, 24, 25|
No task may begin until all of its precursor tasks are completed. Work on the program begins on Monday, September 2, 2002.
For both ENAE 483 and ENAE 788D:
a) Draw a PERT chart for this program.
b) Draw a Gantt chart for this program
c) What is the critical path?
d) How much slack time does Juliet have? How much does Romeo have? Who spends more time waiting around?
e) Which task has the most slack time?
For ENAE 788D only:
f) What is the completion date for this project? (Remember that a nominal work week is five days long.)
g) Because you have given so much joy to children through your toy-making efforts, elves tell you that they will show up in the middle of the night and finish one task of your choice. (Your time allocation for that task is therefore zero.) Which task will you choose to minimize total program time? How much time can you gain on the completion date?