24
Project Scheduling Project Scheduling and Crashing and Crashing

Project Scheduling and Crashing.ppt

Embed Size (px)

DESCRIPTION

uy8

Citation preview

  • Project Scheduling and Crashing

  • Recall the four stagesProject Definition and ConceptualizationProject Planning and BudgetingProject Execution and ControlProject Termination and Closeout

  • Recall the four core knowledge areas

  • Recall the four facilitating knowledge areas

  • Recall the four project player types

  • Recall five processes within the scope knowledge area1. Project Initiation2. Scope Planning3. Scope Definition4. Scope Verification5. Scope Change Control

  • Now we get into the Time Management Knowledge AreaActivity definitionActivity sequencingActivity duration estimatingSchedule developmentSchedule control

  • Activity DefinitionDecompositionWhat has to happen in order to create a WBSComposition from the bottom upUse of a templateA list from a previous project that is similar

  • Consider the 2004 Construction EstimatorExcavationFoundationFlatworkBrick hearth & veneerRough hardwareFinish hardwareRough lumberFinish lumberRough carpentry laborFinish carpentry labor

    Rough carpentry laborFinish carpentry laborCountertopsCabinetsInsulationRoofingPaintingShower & tub

  • Activity SequencingInterview CIOInterview Manager AInterview Manager BInterview Manager CInterview Manager DCompile interview data and analyzePrepare reportPrepare and deliver presentation

  • Sequence RelationshipsFinish/StartStart/StartFinish/FinishStart/Finish

  • Project NetworksActivity on nodeMost popularActivity on arrowNot used

  • From project networks, we determineThe project durationThe critical pathTasks on the critical pathTasks not on the critical pathSlack associated with non-critical tasksEarliest start, earliest finish, latest start and latest finish times

  • Tabular format

  • The AON NetworkA/5D/20B/10E/5F/10C/5

  • The AOA Network

  • Start and Finish DatesES EF

    N/K

    LS LF

  • NotationES earliest start for the node, assumed to be at the beginning of the dayEF earliest finish for the node, assumed to be at the end of the dayLS latest start for the node, assumed to be at the beginning of the dayLF latest finish for the node, assumed to be at the end of the dayN -- the label of the node (task, step, activity)K -- the duration of the node ( number following the slash)

  • Start and Finish DatesES EF

    N/K

    LS LF

  • Precedence RelationsWith FS (FINISH/START) relationships, a successor activity does not start until all of its predecessors are

  • Example 1A/6B/7C/8D/10

  • Example 2A/6B/7C/8D/10

  • Example 3