Project Proposal: Programmed Evaluation And Review Technique

LINEAR PROGRAMMING

Project Proposal

PROJECT MANAGEMENT

CPM & PERT Techniques

Course In charge:

Dr. Syed Jamal Hussain

Presented by:

TARIQ SHABBIR

PROJECT:

A project is an interrelated set of activates that has definite starting and ending point and that results in a unique product or service.

PROJECT MANAGEMENT:

Project management is a scientific way of planning, implementing, monitoring & controlling the various aspects of a project such as time, money, materials, manpower & other resources.

OBJECTIVE OF THE PROJECT:

Programmed Evaluation & Review Technique(PERT)- Used mostly in a research project, where it is difficult to estimate the time taken for various elements of the project.

Critical Path Method(CPM)-

However, PERT assumes that activity durations are random variables (i.e., probabilistic).

Brief History of CPM/PERT

CPM/PERT or Network Analysis as the technique is sometimes called, developed along two parallel streams, one industrial and the other military.

CPM was the discovery of M.R.Walker of E.I.Du Pont de Nemours & Co. and J.E.Kelly of Remington Rand, circa 1957. The computation was designed for the UNIVAC-I computer. The first test was made in 1958, when CPM was applied to the construction of a new chemical plant. In March 1959, the method was applied to a maintenance shut-down at the Du Pont works in Louisville, Kentucky. Unproductive time was reduced from 125 to 93 hours.

PERT was devised in 1958 for the POLARIS missile program by the Program Evaluation Branch of the Special Projects office of the U.S.Navy, helped by the Lockheed Missile Systems division and the Consultant firm of Booz-Allen & Hamilton. The calculations were so arranged so that they could be carried out on the IBM Naval Ordinance Research Computer (NORC) at Dahlgren,

An example of a network digram is shown below. A 1 B 3 D

C Dummy

2

Rules for Network Diagram

1. Before an activity is beginning its preceding activities must be completed. Precedence means the relation between the finished activity and the new activity in which cannot be started before the previous activity get finished.

2. The network should have a unique starting (tail) event and a unique completion(head) event as well.

3. Activity cannot be represented by more than one arc (Activity) in the network.

4. Two activities could not have the same starting node and the same ending node.

5. Dummy activity is indication precedence relationship only. Duration of a dummy activity is zero.

6. Flow of a diagram should be from the left to right.

7. Arrows should not be intersected.

8. Dangling must be avoided.

Rules Inform of Diagram B

A A must finish before B and C can start.