CPM Network Research Articles

Application of Linear Scheduling

Many projects, such as the construction of roadways, pipelines, and high‐rise buildings, involve repetitive activities. A method for scheduling such work, the Linear Scheduling Method (LSM) is presented. In an LSM schedule, the repetitive activities are plotted as lines of constant or varying slopes on two axes, distance versus time. Discrete activities may be shown at their appropriate times and locations and then referenced to a network schedule for additional detail. The Linear Scheduling Method is illustrated by applying it to an actual roadway construction project. The simplicity of the system and advantages for certain types of projects are revealed. A sample schedule is used to derive information that is comparable to what may be obtained from an equivalent CPM network.

A parametric algorithm for convex cost network flow and related problems

The convex cost network flow problem is to determine the minimum cost flow in a network when cost of flow over each arc is given by a piecewise linear convex function. In this paper, we develop a parametric algorithm for the convex cost network flow problem. We define the concept of optimum basis structure for the convex cost network flow problem. The optimum basis structure is then used to parametrize v, the flow to be transsshipped from source to sink. The resulting algorithm successively augments the flow on the shortest paths from source to sink which are implicitly enumerated by the algorithm. The algorithm is shown to be polynomially bounded. Computational results are presented to demonstrate the efficiency of the algorithm in solving large size problems. We also show how this algorithm can be used to (i) obtain the project cost curve of a CPM network with convex time-cost tradeoff functions; (ii) determine maximum flow in a network with concave gain functions; (iii) determine optimum capacity expansion of a network having convex arc capacity expansion costs.

CPM network analysis with a storage tube terminal

CPM network analysis with a storage tube terminal

Pianificazione e controllo della produzione mediante I generatori indipendenti siemens

Planning and control problems are discussed. Siemens preprocessor PAN and SINETIK are oriented to CPM, PERT, MPM and other network methods. Preprocessor PLEIADES provides manufacturing organizations with a large kind of techniques.

Dynamic Programming for Project Cost-Time Curves

Dynamic programming is used to solve the problems of deriving a project cost-time relationship, given the CPM network for the project and the cost-time relationships for all parts of it. The use of dynamic programming allows freedom from restriction in the kind of cost-time relationships used as data, but at the present stage of development of the method, only projects with certain classes of CPM networks can be treated. A simple numerical example is worked and the program and results are given for a computer worked example.