Microsoft PowerPoint - Solutions_to_HW_5

Microsoft PowerPoint - Solutions_to_HW_5 - Problem-1...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
HW # 4 Solutions 1 Problem-1 Absolute Minimum Time for activity 2 A B D C E F G H I 20 60 100 30 20 10 20 10 30 AON Network
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
HW # 4 Solutions 3 [170,200] A B D C E F G H I (0,20 ) (20,80) 20 (80,110) 60 100 3 0 20 10 20 10 3 0 (20,120) (120,140) (140,150) (150,170) (150,160) (170,200) [160,170] [150,170] [140,150] [120,140] [20,120] [90,120] [30,90] [0,20] Critical Path: A-C-E-F-G-I Options: Can crash either A or C C costs $20 per day Vs $30 per day for A Choose the lower cost option ! Crash C by 10 days (See next slide for crashing rules that provide guidelines on by how many days you crash) Iteration 1 : Base Case 4 Crashing Guidelines • The number of days you crash an activity depends on the total slack of activities not on the critical path, and the Time Available for crashing • You crash by the minimum of the following – The Minimum Total Slack of an activity on a non- critical path that will make that path a critical path. – The amount of time available for crashing that activity (Duration – Crash Time) • In Iteration 1 (previous slide), we crash C by Min{10, 25} where o 10 days is the total slack of activity B (and activity D) on a non-critical path A-B-D-E-F-G-I, and crashing C by 10 days will make that path a critical path, and o 25 days is the time available for crashing activity C (Duration – Crash Time)
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 8

Microsoft PowerPoint - Solutions_to_HW_5 - Problem-1...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online