Chapter12PERT/CPMModelsforProjectManagement§1ProjectNetworks计划网络图§2SchedulingaProjectwithPERT/CPM网络时间与关键路线§3DealingwithUncertainActivityDurations§4网络优化1项目管理ProjectManagement项目特征CharacteristicsofProjectsUnique,one-timeoperationsInvolvealargenumberofactivitiesthatmustbeplannedandcoordinatedLongtime-horizonGoalsofmeetingcompletiondeadlinesandbudgetsExamplesBuildingahousePlanningameetingIntroducinganewproductPERT—ProjectEvaluationandReviewTechnique计划评审技术CPM—CriticalPathMethod关键路线法Agraphicalornetworkapproachforplanningandcoordinatinglarge-scaleprojects.可信建筑公司项目ReliableConstructionCompanyProjectP285TheReliableConstructionCompanyhasjustmadethewinningbidof$5.4milliontoconstructanewplantforamajormanufacturer.可信建筑公司中标540万美元的项目Thecontractincludesthefollowingprovisions:Apenaltyof$300,000ifReliablehasnotcompletedconstructionwithin47weeks.如果不能在47周内完成项目,将被罚款30万美元。如果能在40周内完成,将获得15万美元的奖励Abonusof$150,000ifReliablehascompletedtheplantwithin40weeks.Questions:2861.Howcantheprojectbedisplayedgraphicallytobettervisualizetheactivities?如何用图来表示项目中活动流程2.Whatisthetotaltimerequiredtocompletetheprojectifnodelaysoccur?3.Whendotheindividualactivitiesneedtostartandfinish?4.Whatarethecriticalbottleneckactivities?5.对于非关键的活动Forotheractivities,howmuchdelaycanbetolerated承受?6.Whatistheprobabilitytheprojectcanbecompletedin47weeks?7.Whatistheleastexpensivewaytocompletetheprojectwithin40weeks?8.Howshouldongoingcostsbemonitoredtotrytokeeptheprojectwithinbudget?如何对成本进行实时监控,使项目成本控制在预算内活动明细表ActivityListforReliableConstructionActivityActivityDescription紧前ImmediatePredecessors估计工期(Weeks)AExcavate挖掘—2BLaythefoundation打地基A4CPutuptheroughwall承重墙施工B10DPutuptheroof封顶C6EInstalltheexteriorplumbing安装外部管道C4FInstalltheinteriorplumbing安装内部管道E5GPutuptheexteriorsiding外墙施工D7HDotheexteriorpainting外部粉刷E,G9IDotheelectricalwork电路铺设C7JPutupthewallboard竖墙板F,I8KInstalltheflooring铺地板J4LDotheinteriorpainting内部粉刷J5MInstalltheexteriorfixtures设施H2NInstalltheinteriorfixtures安装内部设备K,L6项目网络ProjectNetworks表示整个项目的网络称为项目网络Anetworkusedtorepresentaprojectiscalledaprojectnetwork.Aprojectnetworkconsistsofanumberof节点nodesandanumberofarcs.Twotypesofprojectnetworks:Activity-on-arc(AOA弧表示活动):eachactivityisrepresentedbyanarc.Anodeisusedtoseparateanactivityfromitspredecessors.Thesequencingofthearcsshowstheprecedencerelationships.Activity-on-node(AON节点表示活动):eachactivityisrepresentedbyanode.Thearcsareusedtoshowtheprecedence优先relationships.AdvantagesofAON(usedinthistextbook):P288considerablyeasiertoconstruct易于构建easiertounderstand易于理解easiertorevisewhentherearechanges更便于修改ReliableConstructionProjectNetworkASTARTGHMFJKLNActivityCodeA.ExcavateB.FoundationC.RoughwallD.RoofE.ExteriorplumbingF.InteriorplumbingG.ExteriorsidingH.ExteriorpaintingI.ElectricalworkJ.WallboardK.FlooringL.InteriorpaintingM.ExteriorfixturesN.Interiorfixtures24107467958456200FINISHDIECBMicrosoftProjectGanttChart甘特图W1/1表示第一周第一天;W2/5表示第二周第五天;MicrosoftProject—ProjectNetwork活动名称编号工期最早开始时间最早结束时间P290W1/1第一周第一天开始W2/5第二周第五天完成二周AOAProjectNetwork1235ABCD6GEI4871011139H12FJKLNM关于AOA计划网络图统筹方法的第一步工作就是绘制计划网络图,也就是将工序(或称为活动)进度表转换为统筹方法的网络图。下面用一个例子来说明例3、某公司研制新产品的部分工序与所需时间以及它们之间的相互关系都显示在其工序进度表如表12-8所示,请画出其统筹方法网络图。工序代号工序内容所需时间(天)紧前工序abcde产品设计与工艺设计外购配套零件外购生产原料自制主件主配可靠性试验601513388-aacb,d2表12-8网络图中的节点表示一个事件,是一个或若干个工序的开始或结束,是相邻工序在时间上的分界点,点圆圈表示,数字表示点的编号。弧表示一个工序(或活动),弧的方向是从工序开始指向工序的结束,弧上是各工序的代号,下面标以完成此工序所需的时间(或资源)等数据,即为对此弧所赋的权数.虚工序:只表示相邻工序的前后逻辑关系。需要人力、物力等资源与时间。画网络图的规则:1.两节点之间只能有一条弧(箭线)。两事件一工序2.网络图只能有一个开始节点(事项)和一个终点事项3.不允许有回路,不能有缺口abcb,c的紧前工序为aabcdc,d的紧前工序为a,babcdc的紧前工序为a。d的紧前工序为a和b3绘制网络图分3步:(1)任务分解WBSWorkbreakdownStructure工作项目明细表:工序名称,代号;前后逻辑关系,消耗资源。(2)按表绘制网络图。(3)节点统一编号。采用平行和交叉作业技术例4、把例3的工序进度表做一些扩充,如表12-9,请画出其统筹方法的网络图。表12-9工序代号所需时间(天)紧前工序工序代号所需时间(天)紧前工序abcd60151338-aacefgh810165b,ddde,f,g12453abcde601383815图12-44解:我们把工序f扩充到图12-4发生了问题,由于f的紧前工序是d,故d的结束应该是f的开始,所以代表f的弧的起点应该是④,由于工序b的结束也是④,所以工序b也成了工序f的紧前工序,与题意不符。为此我们利用虚工序。由于e的紧前工序是b和d,在④和⑤之间加入虚工序8e15243a60b151013dc38f图12-55在网络图上添加g、h工序得网络图12-6。在统筹方法的网络图中不允许两个点之间多于一条弧,因此增加了一个点和虚工序如图12-7。615243a60b158e1013dc38fg16h515243a60b158e1013dc38fg16h57681ActivityTime(Weeks)ImmediatePredecessorsActivityTime(Weeks)ImmediatePredecessorsABCDE241064-ABCCHIJKL97845E,GCF,IJJF5EM2HG7DN6K,L2A23B4C4105D67EI46G87F7510J89H9KLM542111312N6关键路线TheCriticalPathApaththroughanetworkisoneoftheroutesfollowingthearrows(arcs)fromthestartnodetothefinishnode.路是指沿着箭头从开始点到终点的一条路线Thelengthofapathisthesumofthe(estimated)durationsoftheactivitiesonthepath.路长度为路上所有活动时间总和The(estimated)projectdurationequalsthelengthofthelongestpaththroughtheprojectnetwork.项目工期等于项目网络中最长路的长度Thislongestpathiscalledthecriticalpath.(Ifmorethanonepathtieforthelongest,theyallarecriticalpaths.)项目网络中最长路称为关键路ThePathsforReliable’sProjectNetworkPathLength(Weeks)StartABCDGHMFinish2+4+10+6+7+9+2=40StartABCEHMFinish2+4+10+4+9+2=31StartABCEFJKNFinish2+4+10+4+5+8+4+6=43StartABCEFJLNFinish2+4+10+4+5+8+5+6=44StartABCIJKNFinish2+4+10+7+8+4+6=41StartABCIJLNFinish2+4+10+7+8+5+6=42关键路线criticalpathP292最早开始时间和最早结束时间Thesta