A network flow computation for project cost curves.

Expert InsightsPublished 1960

A network-flow method for solving the linear-programming problem of computing the least-cost curve for a project composed of many individual jobs, where it is assumed that certain jobs must be finished before others can be started. Each job has an associated crash completion time and a normal completion time, and the cost of doing the job varies linearly between these extreme times. Assuming that the entire project must be completed in a prescribed time interval, the author attempts to find job times that minimize the total project cost. The mehtod solves this problem for all feasible time intervals.

Document Details

  • Availability: Web Only
  • Year: 1960
  • Pages: 2
  • Document Number: P-1947

Citation

Chicago Manual of Style

A network flow computation for project cost curves. Santa Monica, CA: RAND Corporation, 1960. https://www.rand.org/pubs/papers/P1947.html.
BibTeX RIS

This publication is part of the RAND paper series. The paper series was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.