Part I deals with basic computations in PERT network, namely: 1) computation of critical path, 2) expected time to complete the project, 3) probability of completing the project by specified due dates, and 4) manpower loading. Part II deals with the problem of resource levelling in projects under conditions of, 1) single resource requirement, and 2) multiple resource requirement. Certain heuristics are expected to be used for evolving project schedules with levelled resource requirements. Part III Deals with the problem of scheduling activities in project networks under conditions of resource constraints. Both single resource and multiple resource requirements are considered. Use of heuristic procedures for scheduling under such conditions is expected. Certain optimization models for scheduling could also be illustrated.