Accession Number : AD0672363

Title :   OPTIMUM TIME COMPRESSION IN PROJECT SCHEDULING.

Descriptive Note : Themis Optimization research program,

Corporate Author : TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS

Personal Author(s) : Lamberson,L. R. ; Hocking,R. R.

Report Date : 02 MAY 1968

Pagination or Media Count : 33

Abstract : An algorithm based on convex programming is developed for optimum time compression in network scheduling systems. The development allows for the activity time-cost trade-off functions to be any continuous differentiable convex function. Decomposition theory is then applied to reduce the amount of computation necessary. This along with a limited number of rules to structure any incoming vector makes the algorithm amenable to time compression in large project networks. (Author)

Descriptors :   (*MANAGEMENT PLANNING AND CONTROL, SCHEDULING), (*SCHEDULING, OPTIMIZATION), SIMPLEX METHOD, MATRICES(MATHEMATICS), ITERATIONS, MATHEMATICAL PROGRAMMING, ALGORITHMS, FUNCTIONS(MATHEMATICS)

Subject Categories : Administration and Management
      Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE