BUS 31.4 Chapter 13 - Copy

BUS 31.4 Chapter 13 - Copy - Chapter 13 Project Management...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapter 13 – Project Management S. Neuburger Project Management Define project and decompose to significant tasks or activities. Develop sequential relationship among activities (in particular, identify immediate predecessor s) Draw project network Determine time (which we will call t ) and/or cost estimates of each activity Find critical path – path through network with longest total time. CPM – Critical Path Method - deterministic PERT – Program Evaluation and Review Technique – probabilistic When considering a particular activity, every other activity can be classified with respect to it: Predecessor activity – one that must be completed before the given activity can be started Successor activity – can be started only after the given activity is completed. Parallel activity – does not directly depend on the given activity. A path through the network is a sequence of connected tasks from the start of the project to its completion. The path through the network with longest total time is called the
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/01/2010 for the course BUS 5865 taught by Professor Smith during the Spring '10 term at CUNY Baruch.

Page1 / 2

BUS 31.4 Chapter 13 - Copy - Chapter 13 Project Management...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online