a. Develop a network for this project.

b. Compute the 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 of 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 expedited 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 (is) is (are) going to the end.