Optimum time compression in project scheduling /

Bibliographic Details
Main Authors:	Lamberson, Leonard R. (Author), Hocking, R. R. (Ronald R.), 1932- (Author)
Corporate Authors:	United States. Office of Naval Research (sponsoring body.), Texas A & M Research Foundation
Format:	Book
Language:	English
Published:	[College Station, Tex.] : Department of Industrial Engineering and Institute of Statistics, Texas A & M University, 1968.
Series:	Technical report (Texas A & M University. Themis Optimization Research Program) ; no. 2.
Subjects:	Production scheduling > Mathematical models. Project management > Mathematical models. Network analysis (Planning) Convex programming. Mathematical optimization.

Description
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.
Item Description:	"May 2, 1968." "Research conducted through the Texas A & M Research Foundation."
Physical Description:	27 leaves, 8 unnumbered leaves : illustrations ; 28 cm
Bibliography:	Includes bibliographical references (leaves [28-29]).