INTRODUCTION COMPUTER-AIDED PROJECT MANAGEMENT

By -
INTRODUCTION

Although the art of managing projects has existed for thousands of years, it is only relatively recently that modern project management techniques were developed, codified, and implemented in any con- sistent, methodological manner. Perhaps it is not totally coincidental that these techniques came about during the same period as the beginning of the commercial availability of computers as we know them today. As of the writing of this book, we have arrived at a point where hundreds of commercial software applications that address various aspects of the project management processes are available for purchase. For one who is unfamiliar with the wide variety of these tools on the market, the process of selecting and implementing these tools can be a daunting task. The purpose of this chapter is to help make that process somewhat more manageable.

The reader should note that the title of this chapter, ‘‘Computer-Aided Project Management (CAPM),’’ was specifically intended to allow for the discussion of the different types of tools available to facilitate the entire process of project management. To many people, the consideration of project management tools is unfortunately limited to what has become known as project management soft- ware. Granted, this type of tool was among the first applications developed with project management in mind, and it does address an important aspect of project management, namely scheduling and tracking. This author believes, however, that such a tool is but one among many in what we will refer to as a computer-aided project management platform. A CAPM platform is one that includes applications that automate many of the project management processes, not just scheduling and track- ing, and it is this platform that we will discuss below.

The following pages will address the history of the development of CAPM, the use of computers in project management, and the implementation of CAPM platforms in business organizations, and will look at what we might expect of these tools in the years to come. It is hoped that this examination will help the reader better understand the use of CAPM tools while facilitating their selection and successful implementation.

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