Kim Engineering Building H Kim Engineering Building 155000 square foot project 155000 square foot project 16 research labs 16 research labs 6 educational labs 6 educational labs 12000 square foot clean room 12000 square foot clean room One of the mo ID: 72045
Download Pdf The PPT/PDF document "Kim Building Construction Project Kim Bu..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Kim Building Construction ProjectKim Building Construction ProjectCritical Path Modeling, Crashing, Critical Path Modeling, Crashing, Sensitivity Analysis, andSensitivity Analysis, andTimeTime--Cost CurveCost Curve Richard MorganRichard MorganMatt SchechterMatt SchechterDoug TilleyDoug Tilley IntroductionIntroductionJeongH. Kim Engineering BuildingH. Kim Engineering Building155,000 square foot project155,000 square foot project16 research labs16 research labs6 educational labs6 educational labs12,000 square foot clean room.12,000 square foot clean room.==One of the most advanced engineering One of the most advanced engineering facilities in the entire nation!facilities in the entire nation! Course ConceptsCourse ConceptsProject NetworksProject NetworksAOAAONCritical PathCritical PathActivities with 0 slackActivities with 0 slackTime--Cost TradeoffCost TradeoffMinimizing Project DurationMinimizing Project Durationxf-xxi 0.5Closeout 21.3Construction 20.50.50.50.75Review 20.25Agency Review PHASE 0.251.75Closeout 11.1Construction 10.50.5Review 10.5Agency Review PHASE 1.41.5Working Drawings0.20.250.25SPWB Review0.3NoneCrash Costion/Month)Crash Time (months)Cost ($millions)Preceding ActivitiesDuration (months)ActivityLetter AOA ScheduleAOA Schedule Start 6 5 2 4 3 9 8 11 13 EFGHKLM Objective value: 54.00000Objective value: 54.00000Total solver iterations: 0Total solver iterations: 0Variable Value Reduced CVariable Value Reduced CX14 54.00000 0.000X14 54.00000 0.000000 000 X1 0.000000 X1 0.000000 0.0000000.000000X2 10.00000 0.000X2 10.00000 0.000000000X3 12.00000 0.000X3 12.00000 0.000000000X4 28.00000 0.000X4 28.00000 0.000000000X5 14.00000 0.000X5 14.00000 0.000000000X6 15.00000 0.000X6 15.00000 0.000000000X7 18.00000 0.000X7 18.00000 0.000000000X8 42.00000 0.000X8 42.00000 0.000000000X9 44.00000 0.000X9 44.00000 0.000000000X10 20.00000 0.000X10 20.00000 0.000000000X11 21.00000 0.000X11 21.00000 0.000000000X12 24.00000 0.000X12 24.00000 0.000000000X13 52.00000 0.000X13 52.00000 0.000000000Row Slack or Surplus Dual PrRow Slack or Surplus Dual Priceice1 54.00000 1 54.00000 1.0000001.0000002 0.000000 2 0.000000 1.0000001.0000003 0.000000 3 0.000000 1.0000001.0000004 0.000000 4 0.000000 0.0000000.0000005 0.000000 5 0.000000 1.0000001.0000006 0.000000 6 0.000000 1.0000001.0000007 0.000000 7 0.000000 1.0000001.0000008 0.000000 8 0.000000 0.0000000.0000009 0.000000 9 0.000000 0.0000000.00000010 0.000000 10 0.000000 1.0000001.00000011 0.000000 11 0.000000 1.0000001.00000012 0.000000 12 0.000000 1.0000001.00000013 0.000000 13 0.000000 1.0000001.00000014 0.000000 14 0.000000 1.0000001.000000 Thus, Activities A, B, D, E, F, J, K, L, M are on the critical path min = .3*A + 0.2*B + 1.4*C + 0.5*F + 1.1*G + 2*H + 0.5*K + 1.3*Lmin = .3*A + 0.2*B + 1.4*C + 0.5*F + 1.1*G + 2*H + 0.5*K + 1.3*LA=2;A=2;B=0.25;B=0.25;C3;C3;D0;D0;E=0;E=0;F;F;H=0.25;H=0.25;I=0;I=0;J0;J0;K=0.5;K=0.5;L;L;M5;M5;x1+A&#x=0.9;&#x.800;=10;x1+A&#x=0.9;&#x.800;=10;x2+B&#x=0.9;&#x.800;=2;x2+B&#x=0.9;&#x.800;=2;x3&#x=0.9;&#x.800;+C=16;x3&#x=0.9;&#x.800;+C=16;x3&#x=0.9;&#x.800;+D=2;x3&#x=0.9;&#x.800;+D=2;x5+E&#x=0.9;&#x.800;=1;x5+E&#x=0.9;&#x.800;=1;x6&#x=0.9;&#x.800;+F=3;x6&#x=0.9;&#x.800;+F=3;x7+G&#x=0.9;&#x.800;=24;x7+G&#x=0.9;&#x.800;=24;x8&#x=0.9;&#x.800;+H=2;x8&#x=0.9;&#x.800;+H=2;x7+I&#x=0.9;&#x.800;=2;x7+I&#x=0.9;&#x.800;=2;x10+J&#x=0.9;&#x.800;=1;x10+J&#x=0.9;&#x.800;=1;&#x=0.9;&#x.800;x11+K=3;&#x=0.9;&#x.800;x11+K=3;x12+&#x=0.9;&#x.800;L=28;x12+&#x=0.9;&#x.800;L=28;x13+&#x=0.9;&#x.800;M=2;x13+&#x=0.9;&#x.800;M=2;x1=53;x1=53; The activity crash time will be less than the maximum time it is allowed to be crashed. (Final time-Initial time+ActivityCrash Time) must be greater than or equal to the time that an activity can take. time units or less. This code will output the minimum cost. After many cycles, the time-cost curve could be created! InfiniteInfiniteInfiniteBid/Award 2InfiniteDOF WD Review 2InfiniteInfiniteInfiniteInfiniteBid/Award 1InfiniteDOF WD Review 1InfiniteInfiniteInfiniteSPWB ReviewInfinitePreliminary (months)Allowable Increase (months)Allowable Decrease (months)Optimal Use (monthCurrent RHS (months) Problems EncounteredProblems EncounteredThe data was difficult to findThe data was difficult to findEconomic and schedule confidentiality in private projectsconfidentiality in private projectsFound data from building in UCLA Found data from building in UCLA to make realistic predictionsto make realistic predictionsStarted doing project in ExcelStarted doing project in ExcelLindoproved to be much easier to proved to be much easier to use for this projectuse for this project Questions?Questions?