In this problem, we must find the minimum time to prepare dinner. We have a table of the different steps, the time required and prerequisites to do each one. We are allowed to do some steps simultaneously.
a. Because we can do make steps simultaneously, it is useful to make a diagram of how we can proceed.
• The processes that are at the same level can be done at the same time.
,
• The time needed to go to the next level is the time needed to do the longest step of the level.
The least time needed to cook the dinner is given by the following sum:
Time = 0 min (Start) + 1 min (A) + 120 min (B) + 15 min (C) + 14 min (D) + 8 min (I) = 158 min.
So the least time needed to cook dinner is 158 min.
b. The critical path is the longest one:
Start → A → B → C → D → I
Answers
a. 158 min,
b. Start → A → B → C → D → I