Critical Path Problem under Assignment Constraint—An Application of an Extreme Point Mathematical Programming Problom

The paper is concerned with the problem of finding a critical path for a network under the assumption that activities of this network can be accompliEhed by a group of men differing in skills. It is assumed that the cost (per unit time) of hiring depends upon a particular man hired. The above problem is formulated and solved as an extreme point mathematical programming problem. The detailed discussion of a solution procedure is given and to illustrate the approach, a numerical example is presented. Some extensions of this formulation arising from practical considerations are suggested for further work in this direction.