Dijkstra Algorithm.
Budget: $25 – $50 USD
Question 1:
Consider the (simplified) list of activities and predecessors
that are involved in building a house (Table 20).
a Draw a project network, determine the critical path,
find the total float for each activity, and find the free
float for each activity.
Suppose that by hiring additional workers, the dura-
tion of each activity can be reduced. The costs per day
of reducing the duration of the activities are given in
Table 21. Write down the LP to be solved to minimize
the total cost of completing the project within 20 days.
Consider the (simplified) list of activities and predecessors
that are involved in building a house (Table 20).
a Draw a project network, determine the critical path,
find the total float for each activity, and find the free
float for each activity.
Suppose that by hiring additional workers, the dura-
tion of each activity can be reduced. The costs per day
of reducing the duration of the activities are given in
Table 21. Write down the LP to be solved to minimize
the total cost of completing the project within 20 days.