THE LEARNING ORGANIZATION: CONTINUOUS IMPROVEMENT IN PROJECT MANAGEMENT

By -
THE LEARNING ORGANIZATION: CONTINUOUS IMPROVEMENT IN PROJECT MANAGEMENT
Individual Learning and Organizational Learning

Excellence in project management is based on the ability of individuals to initiate, plan, execute, control, and terminate the project scope and product scope successfully. The ability of individuals to master product- and project-related processes is the foundation on which organizational learning is built. Individual learning can take many forms, including the learning of verbal knowledge, intellec- tual skills, cognitive strategies, and attitudes. The learning mechanism can also take many forms, including learning by imitation of other people or learning by repetition of a process.

The ability of groups to improve performances by learning is also very important. Katzenbach and Smith (1993) explain how important it is to combine individual learning with team building.

A project team must combine these two learning processes in order to succeed. As it is important for each individual to learn and master his part in the product scope and in the project scope, it is equally important for the group to learn how to work as a team. Team building and organizational learning are important in the project environment. Establishing clear processes in which the input to each process is well defined and the individuals responsible for the process master the tools and techniques required to do the process right and to produce the desired output enables excellence in project management to be achieved.

Workflow and Process Design as the Basis of Learning

Successful project management requires successful planning, execution, and control of project scope and the product scope. The one-time, nonrepetitive nature of projects makes uncertainty a major factor affecting a project’s success. In addition, the ability to learn by repetition is limited because most projects are unique. A key to project-management success is the exploitation of the repetitive parts of project scope. Identifying repetitive processes (repetitiveness within the project as well as repetitiveness between projects) and building an environment that supports learning and data collec- tion enhances competitiveness in project management.

A key tool in building a learning–supporting environment is the design and implementation of a workflow-management system–a system that defines, manages, supports, and executes information- processing and decision-making processes. Each of the processes discussed in this chapter should be studied, defined, and implemented within the workflow management system. The definition includes the trigger (which initiates the process) of the process, inputs to the process, the participants in the process, the activities performed and required data processing, models used, the order or sequence of processing, and finally, process termination conditions and the process results or deliverables. The workflow-management system employs a workflow-enactment system or workflow-process engines that can create, manage, and execute multiple process instances.

By identifying the repetitive processes shared by many projects performed by an organization, it is possible to implement a workflow system that supports and even automates the repetitive processes. Automation means that the routing of each process is defined along with the input information, processing, and output information. Thus, although the product scope may vary substantially from project to project, the execution of the project scope is supported by an automatic workflow system that reduces the level of uncertainty (processes are clearly defined and the flow of information required to support these processes is automatic) and enables learning. The well-structured process can be taught to new employees or learned by repetition. In projects performed by the organization, the same processes are repeated, the same formats are used to present information, and the same models support decision making.

Definition of processes and the support of these processes by a workflow-management system are key to the success of organizations dealing repeatedly with projects.

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