1 / 17

Scheduling

Scheduling. CTC-415. Activity Network Development. Network Models Activity on Node Precedence Diagram Method Activity on Arrow Network Characteristics Discrete Activities Deterministic Durations Deterministic Logic Activity Flow. Network Elements. Activities Basic building block

belindaj
Download Presentation

Scheduling

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Scheduling CTC-415

  2. Activity Network Development • Network Models • Activity on Node • Precedence Diagram Method • Activity on Arrow • Network Characteristics • Discrete Activities • Deterministic Durations • Deterministic Logic • Activity Flow

  3. Network Elements • Activities • Basic building block • Represent tasks • Must consume time and resources • Milestones • Notice to Proceed • Building Enclosed • Substantial Completion • Project Complete • Activity Relationships • Physical, Safety, Resource, Preferential

  4. Precedence • Succeeding activities cannot start until preceding activities are finished • Changes in duration of one activity affect all succeeding activities

  5. Activity on Node • All activities occur at nodes • Arrows connect nodes and show relationships • Easy to see relationships

  6. Activity on Node • Basics: • Unique Alphanumeric identifier • Unique description • Estimated Duration • Succeeding activity cannot start until preceding activity is finished • Need beginning and ending milestone to tie project together

  7. Constructing an AON Network • Sequential logic • All activities preceding must be finished before next activity can start • Concurrent Logic • 2 or more activities can be worked at one time

  8. Constructing an AON Network • Multiple Successor Logic • 2 or more activities can be worked at one time after common predecessor is finished • Multiple Predecessor Logic • 2 or more activities need to be finished before next activity starts

  9. Constructing an AON Network • Combinational Logic • 2 or more activities can be worked at one time after multiple predecessor activities are finished

  10. Logic Errors and Problems • Incorrect Logic • Activities MUST have a logical connection • Paint color does not control the roofing application • Redundant Logic • Not incorrect • Can cause errors

  11. Logic Errors and Problems • Logic Loops

  12. Activity Numbering • Numbering Activities can make it easier to use schedule • Group like activities under the same general numbers • Activity Category • WBS can make it easy to categorize resources used to each activity • Work Classification • Numbers refer to a class of activity

  13. Activity Numbering • Location • Number activity based on location on project • Responsibility • Numbers refer to who is responsible for work

  14. Activity Numbering • Numbering Conventions • Directional • Numbers increase from start to finish of project • Numbering gaps • Leave gaps between numbers to allow for additions to schedule • Even/Odd Numbering • Even # = part of base contract • Odd # = additional work

  15. Constructing a AON • Determine the relationships between the activities • Forward Pass • Determine when each activity can start based on the finish of the predecessor activities • Backward Pass • Determine when each activity can start based on when the successor activities start

  16. Constructing a AON

  17. Constructing a AON • Critical Path • Path through schedule which provides the shortest time to complete project • Total Float • Amount of time that activity can float without impacting CP • Free Float • Amount of time an activity can be delayed without effecting the early start date of the predecessor activity

More Related