We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byJaden Walburn
Modified about 1 year ago
Copyright © 2008 Pearson Education, Inc. Slide 13-1 Unit 13C Scheduling Problems
Copyright © 2008 Pearson Education, Inc. Slide 13-2 A House Building Project 13-C Each edge is labeled with the number of months needed to complete the task. In some phases of the project, only one task can be undertaken at a time. During other phases, two or more tasks can be carried out concurrently.
Copyright © 2008 Pearson Education, Inc. Slide 13-3 Limiting Tasks and Critical Path When two (or more) tasks can occur at the same time between two stages of the project, the task that requires the most time is called the limiting task. The critical path through the network is the path that includes all the limiting tasks. The length of the critical path is the completion time for the project. 13-C
Copyright © 2008 Pearson Education, Inc. Slide 13-4
a) Finance b) Trim Work c) Design-> Finance -> Construction -> Trim work Copyright © 2008 Pearson Education, Inc. Slide 13-5
Copyright © 2008 Pearson Education, Inc. Slide 13-6 Finding Earliest Start and Finish Times The earliest start time (EST) of a task leaving a particular vertex is the largest of the earliest finish times of the tasks entering that vertex. The earliest finish time (EFT) of a task is the earliest start time of that task plus the time required for the task. That is, EFT = EST + time for task. 13-C
Copyright © 2008 Pearson Education, Inc. Slide 13-7
Copyright © 2008 Pearson Education, Inc. Slide 13-8
Copyright © 2008 Pearson Education, Inc. Slide 13-9 Finding Latest Start and Finish Times The latest finish time (LFT) of a task entering a particular vertex is the smallest of the latest start times of the tasks leaving that vertex. The LFT of a task is the time by which it must be completed to avoid delays. The latest start time (LST) of a task is the latest finish time of that task minus the time required for the task. That is, LST = LFT time for task The LST of a task is the latest possible start without delaying the overall project. 13-C
Copyright © 2008 Pearson Education, Inc. Slide 13-10
Copyright © 2008 Pearson Education, Inc. Slide 13-11
Slack Time The amount of time a task can go over its allotted time without putting the entire project behind schedule. This number is nonnegative. Tasks on the critical path have no slack time. Slack time = LST – EST = LFT – EFT Copyright © 2008 Pearson Education, Inc. Slide 13-12
Slack Time Copyright © 2008 Pearson Education, Inc. Slide 13-13
The Impact of Slack Time Copyright © 2008 Pearson Education, Inc. Slide Example:
The Impact of Slack Time Copyright © 2008 Pearson Education, Inc. Slide Example:
Painting Tasks (hrs) Copyright © 2008 Pearson Education, Inc. Slide 13-16
ANSWERS 21. a, e, f, g, 22. f, g, I, k 23. a, e, f, g, I, h (longest time) Copyright © 2008 Pearson Education, Inc. Slide 13-17
Copyright © 2008 Pearson Education, Inc. Slide 13-18
ANSWERS 29. a) EST - e: 2hs i: 7.5 hrs b) LST - e: 2hrs i: 7.5 hrs 30. a) EST - h: 4.5 k: 9.5 b) LST - h: 5.5 hrs k: 9.5 Copyright © 2008 Pearson Education, Inc. Slide 13-19
Copyright © 2008 Pearson Education, Inc. Slide 13-1 Unit 13C Scheduling Problems.
Copyright © 2005 Pearson Education, Inc. Slide 13-1.
4. Flow-Time Analysis Flow Time 2-Critical Path Method Based on the book: Managing Business Process Flows.
15C Backward scanning and crashing. Rules for network construction 1.Two nodes can be connected directly by a maximum of one edge. 2.An activity must.
Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.
Projects are unique, one-time operations designed to accomplish a specific set of objectives in a limited timeframe Project managers are responsible for.
Project Management Lecture Network Analysis Introduction Project planning Gantt chart and WBS Project planning Network analysis I Project planning Network.
Chapter 7 Project Management © 2007 Pearson Education.
D1: Critical Events And Critical Paths. D1: Critical Events And Paths A critical path is the list of activities on an activity network that, if they are.
CRITICAL PATH DEFINITION. ALL the tasks that determine the end date in your project schedule. The critical path is the longest PATH, through the “AON”
Project Management (2) Chapter 16, Part 2. EJR 2006 Review of Project Management, Part 1 What is a project? Examples of projects Project performance expectations.
2 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Project Management 2.
15B Critical path analysis. In a critical path analysis, edges represent activities. Nodes (vertices) represent the end of one activity and the start.
Gantt Chart Graph or bar chart with a bar for each project activity that shows passage of time Provides visual display of project schedule Slack.
© Pearson Education Limited 2004 OHT 8.1 Cadle and Yeates: Project Management for Information Systems, 4th edition Critical Path Method(CPM)
A brief summary of Critical Path (or network) Analysis Critical Path Analysis is a way of planning complex projects. It allows one to find those parts.
8-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Project Management Chapter 8.
د. باسم ممدوح الحلوانى Lecture 7 Time Management Part 3.
A2 Operations Management Critical Path Analysis. How long will it take? n Walls have decided to launch a new Magnum ice cream. Machine delivery will take.
PREPARED BY : NOR AZAH BINTI AZIZ KOLEJ MATRIKULASI TEKNIKAL KEDAH PROJECT NETWORK DIAGRAM.
EMGT 501 HW # Due Day: Sep You are given the following information about a project consisting of six activities: (a) Construct.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Project Management Operations Management - 5 th Edition Chapter.
Scheduling The Project Scheduling Planning, budgeting and scheduling are all part of the same process Planning a project, developing a budget for it,
Critical Paths. Considering Critical Paths When there are only a few tasks to complete in a project it is relatively easy to find the shortest time to.
1 TCOM 5143 Lecture 11 Project Management. 2 What’s Project Management? Project management involves planning and scheduling the different activities of.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
PROJECT MANAGEMENT Syllabus Outcomes : Construct and interpret a network, identify the critical path, and calculate the free and total float. Evaluate.
In Chapter 5: Scheduling the Project From Action Plan and WBS to Gantt chart and project network. Gantt Chart Project Network Activity-on-arrow
Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 PROJECT MANAGEMENT 18-1 Project Management.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide
1 4. Flow-Time Analysis Inventory adversely affects all competing edges (P/Q/V/D) Has cost Physical carrying costs Financial costs Causes obsolescence.
PMT-1 Project Management Techniques. PMT-2 Project management can be used to manage complex projects. The first step in planning and scheduling a.
PROJECT MANAGEMENT Outline What is project mean? Examples of projects… Project Planning and Control Project Life Cycle Gantt Chart PERT/CPM.
1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science, 3e by Cliff Ragsdale.
EMGT 501 HW #2 Answer. 020/3 X 3 05/601-1/62/3050/3 X 6 0-5/300-2/3-1/3180/3 (c).3/230with )3/80,0,0,3/50,3/20,0(*)*, ( solution Optimal Z.
Practice Slides Unlabeled. Copyright © 2010 Pearson Education, Inc. Plate 1.
Project Scheduling: Networks, Duration Estimation, and Critical Path
Scheduling and Budgeting Engineers Without Frontiers CEE 402.
Chapter 6: Activity Planning – Part 2 NET481: Project Management Afnan Albahli.
Operations Management Session 27: Project Management.
CPA A house is to have new carpets fitted throughout. The work involved has been divided into a number of tasks, as shown in the table.
© 2000 by Prentice-Hall Inc Russell/Taylor Oper Mgt 3/e Chapter 6 Project Management.
1 Topics to cover in 2 nd part ( to p2). 2 Chapter 8 - Project Management Chapter Topics ( to p3)
Project Management Chapter 14. Introduction to Project Management Projects can be simple (planning a company picnic) or complex (planning a space shuttle.
9-1 Project Scheduling: Networks, Duration Estimation, and Critical Path Chapter 9 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
Switch off your Mobiles Phones or Change Profile to Silent Mode.
© 2017 SlidePlayer.com Inc. All rights reserved.