Accession Number : AD0603940

Title :   DIVISIBLE ACTIVITIES IN CRITICAL PATH ANALYSIS,

Corporate Author : AIR FORCE CAMBRIDGE RESEARCH CENTER WASHINGTON D C OPERATIONAL APPLICATIONS LAB

Personal Author(s) : Jewell,William S.

Report Date : 20 FEB 1964

Pagination or Media Count : 28

Abstract : A critical path scheduling problem is investigated in which a single activity can have its completion time divided up and allocated to different 'locations' in the project precedence network. An algorithm for determining the allocation which minimizes total project duration is given, together with an outline of an optimality proof, and an example. Although the algorithm is very similar to those used in network-flow type problems, and uses only integer-valued variables, the final results for the divisible-activity network are, in general rational numbers. (Author)

Descriptors :   (*OPERATIONS RESEARCH, SCHEDULING), (*SCHEDULING, OPERATIONS RESEARCH), OPTIMIZATION, NUMERICAL ANALYSIS, LINEAR PROGRAMMING

Distribution Statement : APPROVED FOR PUBLIC RELEASE