PROJECT MANAGEMENT CYCLE:PROJECT-MANAGEMENT PROCESSES

By -

PROJECT-MANAGEMENT PROCESSES

Definition of a Process

A process is a group of activities designed to transform a set of inputs into required outputs. There are three elements in the transformation of inputs into outputs:

1. Data and information

2. Decision making

3. Implementation and actions

A well-defined set of processes, supported by an appropriate information system (composed of a database and a model base) and implemented by a team trained in performing the processes is a cornerstone in the competitive edge of organizations.

Process Design

The design of a process is aimed at defining the following:

• Data required to support decisions, including:

• The data sources

• How the data should be collected

• How the data should be stored

• How the data should be retrieved

• How the data should be presented as information to decision makers

• Models required to support decisions by transforming data into useful information, including:

• Models that support routine decisions

• Models that support ad hoc decisions

• Models used for process control

• Data and models integration:

• How data from the database is analyzed by the models

• How information generated by the models is transferred and presented to decision makers

The PMBOK and Processes in the Project Life Cycle

A well-defined set of processes that applies to a large number of projects is discussed in the PMBOK (PMI 1996). Although some of the PMBOK processes may not apply to some projects, while other PMBOK processes may need modifications in certain projects, the PMBOK is a well-accepted source of information and therefore the following definition of processes is based on the PMBOK.

The PMBOK classifies processes in two ways:

1. By sequence

• Initiating processes

• Planning processes

• Executing processes

• Controlling processes

• Closing processes

2. By management function:

• Processes in integration management

• Processes in scope management

• Processes in time management

• Processes in cost management

• Processes in quality management

• Processes in human resource management

• Processes in communication management

• Processes in risk management

• Processes in procurement management

The application of these processes in a specific organization requires customization, development of supporting tools, and training.

Comments

Post a Comment

Popular posts from this blog

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn
Read more

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each
Read more

NETWORK OPTIMIZATION MODELS:THE SHORTEST-PATH PROBLEM

By -
Image
THE SHORTEST-PATH PROBLEM Although several other versions of the shortest-path problem (including some for directed networks) are mentioned at the end of the section, we shall focus on the following simple version. Consider an undi r ecte d and connected network with two special nodes called the origin and the destination. Associated with each of the links (undirected arcs) is a non- negative distance. The objective is to find the shortest path (the path with the minimum total distance) from the origin to the destination. A relatively straightforward algorithm is available for this problem. The essence of this procedure is that it fans out from the origin, successively identifying the shortest path to each of the nodes of the network in the ascending order of their (shortest) distances from the origin, thereby solving the problem when the destination node is reached. We shall first outline the method and then illustrate it by solving the shortest-path problem encountered by the See
Read more