MANAGING PROFESSIONAL SERVICES PROJECTS:OVERVIEW OF THE PROJECT MANAGEMENT PROCESS

By -

2. OVERVIEW OF THE PROJECT MANAGEMENT PROCESS

The Phases of Project Management

The project management process includes four phases:

• Phase I: project definition

• Phase II: project planning

• Phase III: project monitoring and control

• Phase IV: project close

Each phase has its purpose and the phases are linked in order. In fact, Phases I through III tend to be iterative. For example, some level of project planning is required to develop reasonably accurate,

high-level estimates of project time and cost during project definition. Likewise, during project ex- ecution, the monitoring and control process may identify situations that will require changes in the project plan and possibly even in the project definition.

3.3. Relationship of Phases to the Delivery of Professional Services

In the professional services context, the project definition serves as the proposal to the client or the statement of work (SOW) issued by the client. Subsequent to any negotiations, the client formally accepts the proposal (or the firm formally accepts the SOW); in many cases a formal contract is executed, often incorporating the proposal or SOW. Detailed project planning then begins.

The project plan sets out the work steps, schedule, resources, and budget necessary to successfully conduct the project. The plan then becomes the basis for routinely monitoring and measuring progress during project execution and applying appropriate controls, when necessary, to make sure the project stays on track.

The project close phase seeks to determine whether the client is satisfied with the results of the work and ensures that the client understands and agrees that the project has been completed.

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