成本与进程管理2.2

CostandScheduleManagement42June2002㎜MJoseph200283BackwardPassStartPrepareAppetizersESLSEFLF0303090909015015015018018018030757590EndShopforIngredientsESLSEFLF60PrepareIngredients60ESLSEFLFMakeMunu30ESLSEFLFCookFood30ESLSEFLF60WashTableware45ESLSEFLFSetTable15ESLSEFLFServeDinner0ESLSEFLF03030909015015018018018030757590303090901501501801801800165120165180120180June2002㎜MJoseph200284CriticalPath0303090909015015015018018018030757590StartEndShopforIngredientsESLSEFLF60PrepareIngredients60ESLSEFLFMakeMunu30ESLSEFLFCookFood30ESLSEFLFPrepareAppetizers60ESLSEFLFWashTableware45ESLSEFLFSetTable15ESLSEFLFServeDinner0ESLSEFLF0309090901501501501801801803075759030309090150150180180180016512016518012018030CostandScheduleManagement43June2002㎜MJoseph200285ExerciseConsiderthedata,onthenextpage,forasmallsoftwaredevelopmentproject(alltimesareindays).A.Drawanetworkdiagramrepresentingtheproject.Putthenodenumbersincirclesanddrawarrowsfromnodetonode,labelingeacharrowwiththeactivityletterandestimatedtime.B.Determinehowmanypathsthereareinthisnetworkdiagram,andlistthepathsandtheirlengths.Forexample,apathmightbewrittenasA-B-E-F-Lwithalengthof12days.C.Whatisthecriticalpathforthisprojectandhowlongisit?D.Whatistheshortesttimeinwhichthisprojectcanbecompleted?E.Canthecriticalpatheverchangeonaproject?F.Cantherebemorethanonecriticalpath?June2002㎜MJoseph200286Exercise(cont抎)ActivityInitialNodeFinalNodeEstimatedTimeA122B134C245D256E352F363G472H582I594J696K781L8103M9104CostandScheduleManagement44June2002㎜MJoseph200287TimeConstraint0303090909015015015018018018030757590StartEndShopforIngredientsESLSEFLF60PrepareIngredients60ESLSEFLFMakeMunu30ESLSEFLFCookFood30ESLSEFLFPrepareAppetizers60ESLSEFLFWashTableware45ESLSEFLFSetTable15ESLSEFLFServeDinner0ESLSEFLF03090909015015015018018018030757590-30-3030309090120120120-6016512016518012018030June2002㎜MJoseph200288AdjustedPERTChart0303090909015015015018018018030756090StartEndShopforIngredientsESLSEFLF60PrepareIngredients60ESLSEFLFMakeMunu30ESLSEFLFCookFood30ESLSEFLFPrepareAppetizers60ESLSEFLFWashTableware45ESLSEFLFSetTable15ESLSEFLFServeDinner0ESLSEFLF0156060609012090120120120156075751515606090901201201200105601051206012015CostandScheduleManagement45June2002㎜MJoseph200289ResourceLimitationID12345678TaskNameTaskATaskBTaskCTaskDTaskETaskFTaskGFinishStartDate1/23/951/23/952/2/952/2/952/13/952/21/952/13/952/27/95EndDate2/1/952/10/952/6/952/8/952/15/952/22/952/27/952/27/958d15d3d5d3d2d11d0dJanuaryFebruary1995DurationSeniorWorker16.080.080.080.0120.088.016.0Helper8.024.024.019.240.040.08.0SCHEDULESHOWINGEARLIESTPOSSIBLEFINISHJune2002㎜MJoseph200290ResourceLimitation(cont抎)ID12345678TaskNameTaskATaskBTaskCTaskDTaskETaskFTaskGFinishStartDate1/23/951/23/952/2/952/28/952/28/953/7/952/13/953/13/95EndDate2/1/952/10/952/6/953/6/953/2/953/9/952/27/953/13/958d15d3d5d3d3d11d0dSeniorWorker16.080.064.040.080.064.080.048.88.0Helper8.024.016.08.040.032.017.612.02.4SCHEDULEWITHRESOURCELEVELINGJanuaryFebruaryMarch1995DurationCostandScheduleManagement46DesignStructureMatrixJune2002㎜MJoseph200292Background•Stepsinaprojectrepresentasystem•System:groupofelementswhicharetiedtogetherbycommonflowsofmaterialsans/orinformation•Systemsanalysisisalsoknownasprocessanalysisandoperationsresearch•Investigatesthebasicstructureofthesystem(process)toexplorealternativeprocessesandoverallsystemefficiencyCostandScheduleManagement47June2002㎜MJoseph200293WhatisaDesignStructureMatrix?•BasictoolofSystemsAnalysis•Adirectionalgraphthatdepictsrelationsshipofelements•Listsallactivities,theinformationflow,anddependencypatterns•AbasictoolformanagingcomplexprojectsJune2002㎜MJoseph200294SampleACTIVITIESABCDEFGHIJKLMNReceivespecificationAAGenerateconceptBXBDesignBetacartridgesCXXCProducebetacartridgesDXDDeveloptestingprogramEXXXETestBetacartridgesFXXXFDesignproductioncartitridgesGXXXXGXXDesignmoldHXXXXHXDesignassemplytoolingIXXIPurchaseMFGequipmentJXXXJFabricatemoldsKXKDebugmoldsLXXXLCertifycartridgeMXXMInitialproductionrunNXXXNCostandScheduleManagement48June2002㎜MJoseph200295RecycleGetSocksGetShoesPutOnShoesPutOnSocksInspectShoesGetSocks1GetShoes2XPutOnShoesX3PutOnSocksXX4InspectShoesX5June2002㎜MJoseph200296Recycle(continued)GetShoesInspectShoesGetSocksPutOnShoesPutOnSocksGetShoes1XInspectShoesX2GetSocks3PutOnShoesX4PutOnSocksXX5CostandScheduleManagement49June2002㎜MJoseph200297BuildaDSMforProjectManagement•StartwithaWBS•Listtheworkpackagesastherowsandcolumnsofasquarematrixinthesameorder•Readingacrosstherowsgivestheinputsnecessaryforaparticulartask•Downthecolumnsshowswheretheoutputsfromeachtaskareused•Realadvantageistofindthemostefficienttasksequence•ThisallowsconstructingaworkablePERTdiagramJune2002㎜MJoseph200298FamiliarExampleABCDEFGHIPreparesandwichesA1GatherequipmantBPacklunchCX1XXPreparelemonadeD1PreparemunchiesE1PackcarFXX1DrivecartogasstationGX1GasupHX1DrivetopicnicIX11.Listalltaskshorizontallyandverticallyinthesameorder2.Acrosseachrowcorrespondingtoatask,markofftheothertasksthatsupplynecessaryinformation.CostandScheduleManagement50June2002㎜MJoseph200299Exa