Holooly Plus Logo
Holooly Plus Logo

Question 17.4: Computing Slack Times Compute slack times for the preceding ...

Computing Slack Times

Compute slack times for the preceding example.

The blue check mark means that this solution has been answered and checked by an expert. This guarantees that the final answer is accurate.
Learn more on how we answer questions.

Either the starting times or the finishing times can be used. Suppose we choose the starting times. Using ES times computed in Example 2 and LS times computed in Example 3, slack times are:

Activity LS ES (LS − ES)
Slack
1-2 0 0 0
1-3 6 0 6
2-4 10 8 2
2-5 8 8 0
3-5 10 4 6
4-5 16 14 2
5-6 19 19 0

Activities that have a slack of zero are on the critical path. Hence, the critical path is 1−2−5−6.

Related Answered Questions

Question: 17.SP.3

A path in a network has three activities. Their standard deviations are 1.50, 0.80, and 1.30. Find the path standard deviation. ...

Verified Answer:

Standard deviations cannot be added, but variances...
Question: 17.SP.5

Costs for a project are $12,000 per week for as long as the project lasts. The project manager has supplied the cost and time information shown. Use the information to: a. Determine an optimum crashing plan b. Graph the total costs for the plan ...

Verified Answer:

a. (1) Compute path lengths and identify the criti...
Question: 17.SP.4

Expected times in weeks and variances for the major activities of an R&D project are depicted in the following table. Determine the probability that project completion time will be: a. 50 weeks or less b. More than 50 weeks ...

Verified Answer:

Compute the mean and standard deviation for each p...
Question: 17.SP.2

Using the computing algorithm, determine the slack times for the following AOA diagram. Identify the activities that are on the critical path. ...

Verified Answer:

The task of determining ES, EF, LS, and LF times c...
Question: 17.SP.1

The following table contains information related to the major activities of a research project. Use the information to do the following: a. Draw a precedence diagram using AOA. b. Find the critical path. c. Determine the expected length of the project. ...

Verified Answer:

a. In constructing networks, these observations ca...
Question: 17.7

Optimal Project Crashing Using the following information, develop the optimal time–cost solution. Project costs are $1,000 per day. ...

Verified Answer:

a. Determine which activities are on the critical ...
Question: 17.6

Computing the Probability that a Project Will and Will Not Be Completed by a Specified Time Using the information from Example 5, answer the following questions: a. Can the paths be considered independent? Why? b. What is the probability that the project can be completed within 17 weeks of its ...

Verified Answer:

a. Yes, the paths can be considered independent, s...
Question: 17.5

Computing Expected Activity Times and Variances, and the Expected Duration and Standard Deviation of Each Path The network diagram for a project is shown in the accompanying figure, with three time estimates for each activity. Activity times are in weeks. Do the following: a. Compute the expected ...

Verified Answer:

a. Path Activity TIMES te = \frac{t_{o}...
Question: 17.3

Computing the Latest Finishing and Starting Times Compute the latest finishing and starting times for the precedence diagram developed in Example 2. ...

Verified Answer:

We must add the LS and LF times to the brackets on...
Question: 17.2

Computing Earliest Starting and Finishing Times Compute the earliest starting time and earliest finishing time for each activity in the diagram shown in Figure 17.5. ...

Verified Answer:

Begin by placing brackets at the two ends of each ...