A Network Flow Computation for Project Cost Curves

D. R. Fulkerson
Additional contact information
D. R. Fulkerson: Mathematics Division, The RAND Corporation

Management Science, 1961, vol. 7, issue 2, 167-178

Abstract: A network flow method is outlined 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 normal completion time, and the cost of doing the job varies linearly between these extreme times. Given that the entire project must be completed in a prescribed time interval, it is desired to find job times that minimize the total project cost. The~method solves this problem for all feasible time intervals.

Date: 1961
References: Add references at CitEc
Citations: View citations in EconPapers (42)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.7.2.167 (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:7:y:1961:i:2:p:167-178

Access Statistics for this article

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