DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
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
Report Date:
1968-05-02
Pagination or Media Count:
33.0
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
Distribution Statement:
APPROVED FOR PUBLIC RELEASE