Consider the following set of activities: Time Predecessor Activity Required Activities A 5 None B 4...

Question

Question

Consider the following set of activities:

a. Draw the CPM network for this problem.

b. Calculate and summarize the earliest and latest start and finish times, the slack for each activity, and the critical activities.

c. What is the earliest time that the project can be completed?

d. If the project needed to be completed two (Time) earlier, what would you recommend?

business Operations-Management

Answer 1

Answer #1

The earliest completion time is 28.

If the project needs to be completed 2 times earlier, the activity G should be crashed ( reduced for time) for 2 days.

Answer 2

Similar Homework Help Questions

From this schedule of activities: Activity Immediate Predecessor Activity Time A --- 4 B A 2...

From this schedule of activities: Activity Immediate Predecessor Activity Time A --- 4 B A 2 C B 3 D B 5 E A 1 F C, D 3 G E, F 2 a. Draw the PERT/CPM network b. Complete the forward and backward pass c. Determine the critical path d. Determine the total duration of the project.
Problem 5: For the given activity network, if there are 35 days required to complete the...

Problem 5: For the given activity network, if there are 35 days required to complete the project, find the following Complete the network by filling in ES, LS, EF and LF Earliest start for activities D, E, F, H, G, L, M ill. Earliest finish for activities D, E, F, H,G,L,M Latest start for activities D, E, F, H, G, LM V. Latest finish activities D, E, F.H.GLM vi. Slack/Float time for each activities D, E, F, H, G, LM...
1. Consider the following project. Activity Duration (weeks)5 Immediate Predecessor(s) Cost (S) 1000 | 400 I 20...

1. Consider the following project. Activity Duration (weeks)5 Immediate Predecessor(s) Cost (S) 1000 | 400 I 200 | 1200 | 500 | 700 | 1200 | 800 | 1800 | 1500 | 400 (a) Construct the activity-on-node (AoN) network for the relations among the activities in the (b) Using the activity-on-node (Ao) network developed in part (a), determine the critical path and the minimum time required to complete the project. Develop the earliest start and finish times, the latest finish...

Consider a project having the following six activities:

Consider a project having the following six activities: Immediate Max Crash cost Activity Predecessors Time (weeks) Crash* per week A none 6 6 N/A B none 5 2 $500 C A 3 2 $1000 D A, B 4 2 $2000 E C, D 5 2 $1250 F D 6 2 $1000 *Shortest possible time for the task 1. Draw the project network and list...
Given is a CPM project network diagram as shown below. Activity Start A B C D...

Given is a CPM project network diagram as shown below. Activity Start A B C D E F G H End day 0 5 6 9 6 9 8 5 4 0 a) The Project Completion time = days. b) The Earliest Start time, ES, of Activity G = days. c) The Latest Finish time, LF, of Acitivity C = days.. d) The critical activities are = (ex. Fill in answer as: ABCD) End Start
also needs daves latest start and latest finish: Dave Fletcher was able to determine the activity...

also needs daves latest start and latest finish: Dave Fletcher was able to determine the activity times for constructing his laser scanning machine. Fletcher would like to determine ES, EF, LS, LF, and slack for e activity. The total project completion time and the critical path should also be determined. Here are the activity times: Activity Time (weeks) Immediate Predecessor(s) Activity Time (weeks) Immediate Predecessor(s) C, E D, F Dave's earliest start (ES) and earliest finish (EF) are: Activity ES...

The table below defines the activities and the normal time duration for each activities within a...

The table below defines the activities and the normal time duration for each activities within a small project. You can decrease (crash) the durations at an additional expense. Table 1 summarizes the time-cost information for the activities to complete the project. Table 1: The time-cost information for the activities Activity Normal Completion Time (weeks) Immediate Predecessor Crash Time (weeks) Normal cost for activities Crash cost for activities/week A 2 - 1 1200 400 B 3 - 1 1400 500 C...
Consider a project having the following six activities:

Consider a project having the following six activities: Immediate Max Crash cost Activity Predecessors Time (weeks) Crash* per week A none 7 7 N/A B none 3 2 $500 C A 5 3 $1000 D A, B 6 4 $2000 E C, D 4 3 $1250 F D 3 2 $1000 *Shortest possible time for the task 1. Draw the project network and list...
11. In CPM/PERT, an activity that is on the critical path A. has equal values for...

11. In CPM/PERT, an activity that is on the critical path A. has equal values for "Latest Start" and "Earliest Start" ( LS = ES ) B. has equal values for "Latest Finish" and "Earliest Finish" ( LF = EF ) C. is used in calculating total project duration D. has slack equal to zero E. all of the above 12. In CPM/PERT, the critical path through the network A. will require the most time of any path B. will...

The following activities are part of a project to be scheduled using CPM: ACTIVITY IMMEDIATE PREDECESSOR...

The following activities are part of a project to be scheduled using CPM: ACTIVITY IMMEDIATE PREDECESSOR TIME (WEEKS) A — 3 B A 9 C A 5 D C 2 E B D 7 F D 6 G E F 4 b. What is the critical path? A-B-D-F-G A-B-E-G A-C-D-F-G A-C-D-E-G c. How many weeks will it take to complete the project? Number of weeks d. How much slack does activity B have? Slack of activity B week(s)