For the following sitution draw a PERT network, and determine the following: Critical path ES,LS,EF,LF and slack time for each activity Activity Immediate  predecessor(s) Optimistic  time Most probabl time Pessimistic  time Crashing cost/day $$ Minimum expected completion time    A   1 1 1 900 1    B A 3 6 8 400 2 C A 4 5 6 700 3 D A 2 3 4 800 3 E A 9 9 15     F B 7 8 8 300 5 G B 4 7 9 500 3 H C 1 3 9 700 3 I D 5 6 7     J F,G,H 3 4 8 1100 2 K H,I 2 3 7 650 3 L H,I 7 7 8 300 4 M D 8 9 15     N M 10 15 17 1400 7 O M 3 6 9 600 4 P D 6 12 13 550 7 Q M 8 9 12 980 4 R P,Q 3 6 7     S O,R 7 8 12     T J,K,L,N 6 7 12 520 5 U J,K 4 5 5     V J,K 2 2 2 100 1 W E,S,T,U,V 5 6 9     X E,S,T,U,V 9 10 10 650 3 Y W 3 4 6 50 2 Z X,Y 7 8 9   4   Probability to complete the project in 8 days plus the calculated expected completion time or less.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
icon
Related questions
icon
Concept explainers
Topic Video
Question

please don't take answer from chegg

 

For the following sitution draw a PERT network, and determine the following:

  • Critical path
  • ES,LS,EF,LF and slack time for each activity

Activity

Immediate  predecessor(s)

Optimistic

 time

Most probabl time

Pessimistic

 time

Crashing cost/day

$$

Minimum expected completion time

   A

 

1

1

1

900

1

   B

A

3

6

8

400

2

C

A

4

5

6

700

3

D

A

2

3

4

800

3

E

A

9

9

15

 

 

F

B

7

8

8

300

5

G

B

4

7

9

500

3

H

C

1

3

9

700

3

I

D

5

6

7

 

 

J

F,G,H

3

4

8

1100

2

K

H,I

2

3

7

650

3

L

H,I

7

7

8

300

4

M

D

8

9

15

 

 

N

M

10

15

17

1400

7

O

M

3

6

9

600

4

P

D

6

12

13

550

7

Q

M

8

9

12

980

4

R

P,Q

3

6

7

 

 

S

O,R

7

8

12

 

 

T

J,K,L,N

6

7

12

520

5

U

J,K

4

5

5

 

 

V

J,K

2

2

2

100

1

W

E,S,T,U,V

5

6

9

 

 

X

E,S,T,U,V

9

10

10

650

3

Y

W

3

4

6

50

2

Z

X,Y

7

8

9

 

4

 

  • Probability to complete the project in 8 days plus the calculated expected completion time or less.
  • Given the answers obtained in parts a and b, suppose the project has fixed costs per day of $1000. Also suppose you could reduce the length of the project’s duration by expediting certain activity’s expected time at a given cost shown in the table above to some minimum number of days, what would you recommend?
Expert Solution
steps

Step by step

Solved in 3 steps with 7 images

Blurred answer
Knowledge Booster
Inventory management
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.