Optimum Time Compression in Project Scheduling

L. R. Lamberson and R. R. Hocking
Additional contact information
L. R. Lamberson: Department of Industrial Engineering, General Motors Institute
R. R. Hocking: Institute of Statistics, Texas A & M University

Management Science, 1970, vol. 16, issue 10, B597-B606

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 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.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.10.B597 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:16:y:1970:i:10:p:b597-b606

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().