Question

A construction company has a project proposal, which takes 10 activities as follows: Activity Predecessors Activity...

A construction company has a project proposal, which takes 10 activities as follows:

Activity

Predecessors

Activity Duration Time

(In DAYS )

Early Start (ES)

(In DAYS )

Early Finish

(EF)

(In DAYS )

Late Start (LS)

(In DAYS )

Late Finish

(LF)

(In DAYS )

SLACK

(In DAYS )

A

-

14

B

-

13

C

A

11

D

A

15

E

B

14

F

B

11

G

D, E

13

H

F

15

J

C

12

K

G,H

11

  1. Complete the table.                                                                                                       (11 pts)
  2. What is the critical path?                                                                                                ( 5 pts)
  3. Based on critical path, what is the expected time in days to complete this project?            ( 5 pts)
  4. Is it possible to delay activity-B without delaying the project?                                            ( 1 pts)
  5. If “yes,” then how many days can activity-B be delayed without delaying the project?      

If “No,” then list at least one activity which can be delayed without delaying the project.       ( 1 pts)

  1. Is it possible to delay activity-G without delaying the project?                                           ( 1 pts)
  2. If “yes,” then how many days can activity-G be delayed without delaying the project?      

If “No,” then list at least one activity which can be delayed without delaying the project.       ( 1 pts)

0 0
Add a comment Improve this question Transcribed image text
Answer #1


ACTIVITY

DURATION

ES

EF

LS

LF

SLACK

CRITICAL

A

14

0

14

0

14

0

YES

B

13

0

13

2

15

2

C

11

14

25

30

41

16

D

15

14

29

14

29

0

YES

E

14

13

27

15

29

2

F

11

13

24

16

27

3

G

13

29

42

29

42

0

YES

H

15

24

39

27

42

3

I

12

25

37

41

53

16

J

11

42

53

42

53

0

YES

FORWARD PASS: ES = MAXIMUM EF OF ALL PREDECESSOR ACTIVITIES; 0 IF NO PREDECESSORS ARE PRESENT. EF = ES + DURATION OF THE ACTIVITY.

BACKWARD PASS: LF = MINIMUM LS OF ALL SUCCESSOR ACTIVITIES; COMPLETION TIME OF THE PROJECT IF NO SUCCESSORS ARE PRESENT. LS = LF - DURATION OF THE ACTIVITY.

SLACK = LF - EF, OR, LS - ES

CRITICAL PATH = PATH WITH THE LONGEST COMBINED DURATION VALUE AND 0 SLACK.

CRITICAL PATH = A-D-G-J

DURATION OF PROJECT = 53

D. YES, 2 DAYS SINCE SLACK = 2

F. NO, SINCE G IS A CRITICAL ACTIVITY

WE CAN DELAY I BY 16 DAYS WITHOUT DELAYING THE PROJECT

Add a comment
Know the answer?
Add Answer to:
A construction company has a project proposal, which takes 10 activities as follows: Activity Predecessors Activity...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • .8-6. A project consists of 12 activities, represented by the project network below, where number by each arc repres...

    .8-6. A project consists of 12 activities, represented by the project network below, where number by each arc represents the duration (in days) of the associated activity 4 12 4 12 10 a) Find the earliest time, latest time, and slack for each event as well as the slack for each activity. Also identify the critical path. (b) The project has been scheduled to be completed in the minimum possible time.If all previous activities have begun as early as possible...

  • A Question 11 The following table provides a list of activities in a project, along with...

    A Question 11 The following table provides a list of activities in a project, along with their respective durations and precedence requirements: Immediate Duration Activity Predecessor(s) (weeks) 2 B 3 C B D А E A.C 1 F DE 3 с 3 2 6 G Determine the amount of slack time for Activity E: a. O weeks b. 1 week C. 2 weeks O d. 3 weeks Question 12 Assume that activity A has the following times: Early start time...

  • Consider the following project activities: Calculate the expected time (te) for each activity. Draw an Activity...

    Consider the following project activities: Calculate the expected time (te) for each activity. Draw an Activity on Node (AON) diagram to reflect the flow of these activities. Calculate the Early Start (ES), Early Finish (EF), Late Start (LS), and Late Finish (LF) for each activity. Calculate the slack for each activity. Identify all activities on the Critical Path. Use the data to calculate the probability the project will finish in 20 weeks (Hint: z-score). Activity A 8 с D E...

  • Consider the following project network and activity times (in weeks): Start Finish Activity | A B C D E F G H Time 5 37...

    Consider the following project network and activity times (in weeks): Start Finish Activity | A B C D E F G H Time 5 37 6 7 310 8 a. Identify the critical path. b. How much time will be needed to complete this project? c. Can activity D be delayed without delaying the entire project? If so, by how many weeks? d. Can activity C be delayed without delaying the entire project? If so, by how many weeks? What...

  • Consider the following project. Activity ImmediateActivity Time (days) Predecessor CD E,F What is the critical path? O ACFG O ADFG OBEG ACDFG What is the latest finish time for activity F? 0 9 O...

    Consider the following project. Activity ImmediateActivity Time (days) Predecessor CD E,F What is the critical path? O ACFG O ADFG OBEG ACDFG What is the latest finish time for activity F? 0 9 O 13 O 16 What is the latest possible time that Activity E can be started without delaying the completion of the project? What is the latest time that activity B can finish without delaying any other activities? 4 What is the latest time that activity B...

  • Consider the following project where times are in weeks. Activity Duration Immediate Predecessors A B с...

    Consider the following project where times are in weeks. Activity Duration Immediate Predecessors A B с D E F G H A.B B A с E,F 8 12 7 4 2 3 7 3 DF a) Determine the activity schedule (ES, EF, LS, and LF) as well as slack using the information from the table above (11 marks) b) Determine all the possible paths of this project and determine the shortest possible time this project can be completed? (4 marks)...

  • 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...

  • 20 The late finish time (LF) is a the latest possible date an activity can be...

    20 The late finish time (LF) is a the latest possible date an activity can be completed without delaying the project's completion b c the maximum extent to which an activity can be delayed the latest possible date an activity can be completed before the activity becomes irrelevant d the latest possible time an activity can be completed on a given day 21 A critical path a is the longest individual path in a network b is the path of...

  • A project has the following set of activities Activity Immediate Predecessor Duration (weeks) A - 8...

    A project has the following set of activities Activity Immediate Predecessor Duration (weeks) A - 8 B - 10 C A 3 D A 7 E B, C 6 F B, C 7 G D, E 5 H F 3 Draw the AON diagram Identify all the possible paths What is the critical path? Can activity B be delayed without delaying the completion of the project? If so, by how many days?

  • Using the following information about Project A, its activities and predecessor activities below: Activity Predecessors A...

    Using the following information about Project A, its activities and predecessor activities below: Activity Predecessors A в B C D E, F D G The following table contains the pessimistic, likely, and optimistic estimates for how long activities are estimated to take for Project A. Activity Pessimistic Likely Optimistic 2 5 20 H 16 e. Calculate the time estimates (TE) f. Calculate the variance (s) g. Convert the TE to whole integers and place them in the network diagram for...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT