Presentation is loading. Please wait.

Presentation is loading. Please wait.

Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU.

Similar presentations


Presentation on theme: "Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU."— Presentation transcript:

1 Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU

2 What ’ s a Project? Bringing about change is hard Many related activities Hard to plan production A project focuses on the outcome Regular teamwork focuses on the work process

3 Examples of Projects Building construction New product introduction Software implementation Training seminar Research project

4 Project Scheduling Establishing objectives Determining available resources Sequencing activities Identifying precedence relationships Determining activity times & costs Estimating material & worker requirements Determining critical activities

5 Project Scheduling Techniques Gantt chart Critical Path Method (CPM) Program Evaluation & Review Technique (PERT)

6 Gantt Chart

7 PERT & CPM Network techniques Developed in 1950 ’ s CPM by DuPont for chemical plants PERT by U.S. Navy for Polaris missile Consider precedence relationships & interdependencies Each uses a different estimate of activity times

8 Completion date? On schedule? Within budget? Probability of completing by...? Critical activities? Enough resources available? How can the project be finished early at the least cost? Questions Answered by PERT & CPM

9 PERT & CPM Steps Identify activities Determine sequence Create network Determine activity times Find critical path Earliest & latest start times Earliest & latest finish times Slack

10 Activity on Node (AoN) 2 4? Years Enroll Receive diploma Project: Obtain a college degree (B.S.) 1 month Attend class, study etc. 1 1 day 3

11 Activity on Arc (AoA) 4,5 ? Years Enroll Receive diploma Project: Obtain a college degree (B.S.) 1 month Attend class, study, etc. 1 1 day 234

12 AoA Nodes Have Meaning Graduating Senior Applicant Project: Obtain a college degree (B.S.) 1 Alum 234 Student

13 Activity Relationships 1-2 must be done before 2-3 or 3-4 can start

14 Activity Relationships 2-3 must be done before 3-4 or 3-5 can start

15 Activity Relationships 2-4 and 3-4 must be done before 4-5 can start

16 Activity Relationships When 5-6 is done, project is complete

17 Network Example You ’ re a project manager for Bechtel. Construct the network. ActivityPredecessors A-- BA CA DB EB FC GD HE, F

18 Network Example - AON ACEFBDGHZ

19 Network Example - AOA A C F E B D H G

20 AOA Diagrams 231 A C B D A precedes B and C, B and C precede D 241 A C B D 354 Add a phantom arc for clarity.

21 Critical Path Analysis Provides activity information Earliest (ES) & latest (LS) start Earliest (EF) & latest (LF) finish Slack (S): Allowable delay Identifies critical path Longest path in network Shortest time project can be completed Any delay on activities delays project Activities have 0 slack

22 Critical Path Analysis Example

23 Network Solution A A E E D D B B C C F F G G

24 Earliest Start & Finish Steps Begin at starting event & work forward ES = 0 for starting activities ES is earliest start EF = ES + Activity time EF is earliest finish ES = Maximum EF of all predecessors for non-starting activities

25 Activity A Earliest Start Solution For starting activities, ES = 0. A A E E D D B B C C F F G G

26 Earliest Start Solution A A E E D D B B C C F F G G

27 Latest Start & Finish Steps Begin at ending event & work backward LF = Maximum EF for ending activities LF is latest finish; EF is earliest finish LS = LF - Activity time LS is latest start LF = Minimum LS of all successors for non-ending activities

28 Earliest Start Solution A A E E D D B B C C F F G G

29 Latest Finish Solution A A E E D D B B C C F F G G

30 Compute Slack

31 Critical Path A A E E D D B B C C F F G G

32 New notation Compute ES, EF for each activity, Left to Right Compute, LF, LS, Right to Left C 7 LSLF ESEF

33 PERT Activity Times 3 time estimates Optimistic times (a) Most-likely time (m) Pessimistic time (b) Follow beta distribution Expected time: t = (a + 4m + b)/6 Variance of times: v = (b - a) 2 /36  

34 Project Times Expected project time (T) Sum of critical path activity times, t Project variance (V) Sum of critical path activity variances, v

35 PERT Probability Example You ’ re a project planner for Sun Microsystems. A software project has an expected completion time of 40 weeks, with a standard deviation of 5 weeks. What is the probability of finishing the project in 50 weeks or less?

36 Converting to Standardized Variable From Normal Distribution Table, Probability = =

37 Time-Cost Models 1. Identify the critical path 2. Find cost per day to expedite each node on critical path. 3. For cheapest node to expedite, reduce it as much as possible, or until critical path changes. 4. Repeat 1-3 until no feasible savings exist.

38 Benefits of PERT/CPM Useful at many stages of project management Mathematically simple Use graphical displays Give critical path & slack time Provide project documentation Useful in monitoring costs

39 Limitations of PERT/CPM Clearly defined, independent, & stable activities Specified precedence relationships Activity times (PERT) follow beta distribution Subjective time estimates Over emphasis on critical path

40 Conclusion Explained what a project is Summarized the 3 main project management activities Drew project networks Compared PERT & CPM Determined slack & critical path Computed project probabilities


Download ppt "Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU."

Similar presentations


Ads by Google