The students were given an automated factory project with three parts to complete over different time periods. In part one, the critical path was activities 1, 4, 10, 19, 25, 32, 40, 41, and 42, taking 125 days at a cost of $3,789,490. In part two, the critical path was activities 1, 5, 16, 22, 27, 33, and 41, allowing completion in 98 days at a cost of $4,428,110. In part three, the critical path was activities 1, 4, 10, 19, 25, 32, and 42, with the most likely completion time being 110 days.

1. Automated Factory Project
James Burgess
Chris Diefenderfer
Nick Vangeli
Michael Vitoroulis
Nathan Webb

2. For our automated factory project, we were given three different parts to complete our
project. Each part had different amount of days that the project should be completed in. In the
first part of the project, we had to develop a project and schedule for the least cost/most days,
compute the early start, early finish, late start, late finish, slack, and free slack. We wrote down
each activity and how many days it would take for each one to complete. We were given start
times and finish times of when they were each going to be completed. Each activity was also
given a late start and late finish with respect to their early start and finish days. Each activity is
also given an amount of slack, which is the allotted amount of time that a task can slip before it
affects another task or the project's finish date. Some of the activities are given free slack as well,
which is the amount of time a task can be delayed before its successor task is delayed. Once all
of this was given, we then wrote down how much each activity cost for how many days it would
take to be completed. It takes 125 days for the entire project to be completed and a total of
$3,789,490. The critical path for this part of the project was activity 1, 4, 10, 19, 25, 32, 40, 41,
and 42.
In the second part of this project, we had to develop a project network and schedule for
the least days/most cost. When we wrote down the different days some of the activities needed to
be completed by, we saw that the project could be completed within 98 days instead of the 125
days previously stated. Once this information was put into the system, we found the critical path
for how the project should be completed. The critical path for the project at this point is activity
1, 5, 16, 22, 27, 33, and 41. The new cost for the project is $4,428,110 and is more sensitive than
least cost most days.
In the third part of the project, we determined the most likely amount of days that the
project would be completed in. Once we change the correct activity days, it came out to be 110

3. days. Once this was done, the critical path was changed. The new critical path for the project was
activities 1, 4, 10, 19, 25, 32, and 42. We also had to figure out the weighted average time each
activity would be done in, the activities standard deviation, and its activity variance. To find the
weighted average time, we had to add the worst case to the most likely, add the sum of 4 times
the best case, and then divide that whole answer by 6 in order to find the weighted average time.
In order to find the activities standard deviation, we had to find the difference of the best case
and the worst case and then divide that by 6. To find the activity variance, we had to square the
standard deviation.
The object of this project is to determine how long it will take for a certain project to be
completed and what is the right path to take in order to complete it. The bottom line of this is
project is that it will be completed in the most likely amount of days that were given to us. The
alternate solutions for doing this are the worst case, the most amounts of days, the best case, the
least amount of days, and the most likely case. The probability for completing the project in 107
days is 7.3%. We recommend that the project should get done in the most efficient way by using
the least cost because we would rather spend less money and take more time to do it rather than
taking less amount of time and spending more money.

4. 3
6
7
8 9
10
11
12
13
14
15
17
18
19
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41 42
43
44
2
4
5
1
16
20
Critical path for part 1

5. 2 3
4
5
6
7
8 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41 42
43
44
1
Critical path for part 2

6. 2 3
4
5
6
7
8 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41 42
43
44
1
Critical path for part 3