http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Optimum time compression in project scheduling
27 leaves, 8 unnumbered leaves : illustrations ; 28 cm
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.
"Research conducted through the Texas A & M Research Foundation."
Includes bibliographical references (leaves [28-29]).
Sponsored by the Office of Naval Research N00014-68-A-0140 NR047-700
Technical report (Texas A & M University. Themis Optimization Research Program) ; no. 2